Submission details
Task:Longest palindrome
Sender:aalto26iw_001
Submission time:2026-11-04 17:12:15 +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
#7--details
#8--details
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11--details
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16--details

Compiler report

input/code.cpp: In function 'std::string longestPalindrome(std::string, std::string)':
input/code.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     while (center < r.length())
      |            ~~~~~~~^~~~~~~~~~~~
input/code.cpp:14:68: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         while (center - (radius + 1) >= 0 && center + (radius + 1) < r.length() && r[center - (radius + 1)] == r[center + (radius + 1)])
      |                                              ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
input/code.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < palindromeLengths....

Code

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

string longestPalindrome(string s, string r)
{
    vector<int> palindromeLengths(r.length(), 0);

    int center = 0;
    int radius = 0;
    while (center < r.length())
    {
        while (center - (radius + 1) >= 0 && center + (radius + 1) < r.length() && r[center - (radius + 1)] == r[center + (radius + 1)])
        {
            radius++;
        }
        palindromeLengths[center] = radius;
        int oldCenter = center;
        int oldRadius = radius;
        center++;
        radius = 0;
        while (center <= oldCenter + oldRadius)
        {
            int mirroredCenter = oldCenter - (center - oldCenter);
            int maxMirroredRadius = oldCenter + oldRadius - center;

            if (palindromeLengths[mirroredCenter] < maxMirroredRadius)
            {
                palindromeLengths[center] = palindromeLengths[mirroredCenter];
                center++;
            }
            else if (palindromeLengths[mirroredCenter] > maxMirroredRadius)
            {
                palindromeLengths[center] = maxMirroredRadius;
                center++;
            }
            else
            {
                radius = maxMirroredRadius;
                break;
            }
        }
    }
    int maxCenter = 0;
    int maxLength = 0;
    for (int i = 0; i < palindromeLengths.size(); i++)
    {
        if (palindromeLengths[i] > maxLength)
        {
            maxLength = palindromeLengths[i];
            maxCenter = i;
        }
    }
    string result;
    for (int i = (maxCenter) - (maxLength); i < maxCenter + maxLength; i++)
    {
        if (r[i] != '#')
        {
            result += r[i];
        }
    }
    return result;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    string s, t;
    cin >> s;
    string r = "#";
    for (int i = 0; i < s.size(); i++)
    {
        r = r + s[i] + '#';
    }
    cout << longestPalindrome(s, r) << endl;
}

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:

input
abaabaaaaaaabaababbbbbbabaaabb...

correct output
babbbabbbaabbbbaabbbbbbbbaabbb...

user output
(empty)

Test 8

Verdict:

input
txolestmgyepwrpofxyesjtsfkhjac...

correct output
yxnbaabnxy

user output
(empty)

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)