Submission details
Task:Longest palindrome
Sender:aalto26iw_005
Submission time:2026-11-04 17:06:02 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3--details
#4--details
#5--details
#6--details
#7ACCEPTED0.13 sdetails
#8ACCEPTED0.04 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11--details
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16--details

Code

#include <iostream>
#include <string>

using namespace std;

int main(){
    string input;
    cin >> input;

    string longest_substring = "";
    int longest_length = 0;

    int n = input.length();
    
    // Check for even palindromes
    for (int character = 0; character < n; character++)
    {
        int left = character;
        int current_length = 0;
        string current_string = "";        
        int right = character + 1;
        
        //std::cout << "\n Boundaries: " << left << " " << right;

        // in bounds
        while ((0 <= left) && (right < n))
        {
            //std::cout << "\n Looping: " << left << " " << right;

            //std::cout << "\n Comparing: " << input[left] << " " << input[right];
            if (input[left] == input[right])
            {
                current_length += 2;
                current_string = input[left] + current_string + input[right];
            }
            else 
            {
                break;
            }

            left--;
            right++;

        }
        
        if (current_length > longest_length) {
            longest_length = current_length;
            longest_substring = current_string;
        }

    }

    // Check for odd palindromes
    for (int character = 0; character < n; character++)
    {
        int left = character - 1;
        int right = character + 1;   

        int current_length = 1;

        string current_string = "";
        current_string += input[character];     
     
        //std::cout << "\n Boundaries: " << left << " " << right;

        // in bounds
        while ((0 <= left) && (right < n))
        {
            //std::cout << "\n Looping: " << left << " " << right;

            //std::cout << "\n Comparing: " << input[left] << " " << input[right];
            if (input[left] == input[right])
            {
                current_length += 2;
                current_string = input[left] + current_string + input[right];
            }
            else 
            {
                break;
            }

            left--;
            right++;

        }
        
        if (current_length > longest_length) {
            longest_length = current_length;
            longest_substring = current_string;
        }

    }

    //std::cout << longest_length;
    std::cout << longest_substring;
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
aaaaaaaaaa

correct output
aaaaaaaaaa

user output
aaaaaaaaaa

Test 2

Verdict: ACCEPTED

input
ababababab

correct output
ababababa

user output
ababababa

Test 3

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

user output
(empty)

Test 4

Verdict:

input
ababababababababababababababab...

correct output
ababababababababababababababab...

user output
(empty)

Test 5

Verdict:

input
aztdvxzjwxtrludymvpradgbdpgnrq...

correct output
aztdvxzjwxtrludymvpradgbdpgnrq...

user output
(empty)

Test 6

Verdict:

input
vvfigwwsyxbukedgcfyibvtbclybud...

correct output
vvfigwwsyxbukedgcfyibvtbclybud...

user output
(empty)

Test 7

Verdict: ACCEPTED

input
abaabaaaaaaabaababbbbbbabaaabb...

correct output
babbbabbbaabbbbaabbbbbbbbaabbb...

user output
babbbabbbaabbbbaabbbbbbbbaabbb...

Test 8

Verdict: ACCEPTED

input
txolestmgyepwrpofxyesjtsfkhjac...

correct output
yxnbaabnxy

user output
yxnbaabnxy

Test 9

Verdict: ACCEPTED

input
ihpohpzoffel

correct output
ff

user output
ff

Test 10

Verdict: ACCEPTED

input
flexflexvpqxierullgcfckjqflexf...

correct output
cfc

user output
cfc

Test 11

Verdict:

input
aabbabaabbaababbabaababbaabbab...

correct output
abaababbaabbabaababbabaabbaaba...

user output
(empty)

Test 12

Verdict: ACCEPTED

input
obsession

correct output
ses

user output
ses

Test 13

Verdict: ACCEPTED

input
abcxcbaxcba

correct output
abcxcba

user output
abcxcba

Test 14

Verdict: ACCEPTED

input
zzabc

correct output
zz

user output
zz

Test 15

Verdict: ACCEPTED

input
aaccaabbaaccaaccaabbaaccaa

correct output
aaccaabbaaccaaccaabbaaccaa

user output
aaccaabbaaccaaccaabbaaccaa

Test 16

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

user output
(empty)