Submission #64100025


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> prefix_function(string &s) {
int n = s.size();
vector<int> pi(n);
for (int i = 1; i < n; i++) {
int j = pi[i-1];
while (j > 0 && s[i] != s[j])
j = pi[j-1];
if (s[i] == s[j])
j++;
pi[i] = j;
}
return pi;
}
int main() {
string s;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> prefix_function(string &s) {
    int n = s.size();
    vector<int> pi(n);
    for (int i = 1; i < n; i++) {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j])
            j = pi[j-1];
        if (s[i] == s[j])
            j++;
        pi[i] = j;
    }
    return pi;
}

int main() {
    string s;
    cin >> s;
    string rev_s(s.rbegin(), s.rend());
    string combined = rev_s + "#" + s;
    vector<int> pi = prefix_function(combined);
    int k = pi.back();
    string result = s + rev_s.substr(k);
    cout << result << endl;
    return 0;
}

Submission Info

Submission Time
Task F - ABCBA
User gourav100110
Language C++ 17 (gcc 12.2)
Score 500
Code Size 679 Byte
Status AC
Exec Time 14 ms
Memory 10512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 36
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3508 KB
sample_02.txt AC 1 ms 3556 KB
sample_03.txt AC 1 ms 3704 KB
test_01.txt AC 1 ms 3560 KB
test_02.txt AC 1 ms 3576 KB
test_03.txt AC 1 ms 3532 KB
test_04.txt AC 1 ms 3660 KB
test_05.txt AC 1 ms 3424 KB
test_06.txt AC 1 ms 3500 KB
test_07.txt AC 1 ms 3576 KB
test_08.txt AC 1 ms 3564 KB
test_09.txt AC 1 ms 3516 KB
test_10.txt AC 14 ms 10512 KB
test_11.txt AC 13 ms 10436 KB
test_12.txt AC 13 ms 10424 KB
test_13.txt AC 13 ms 10424 KB
test_14.txt AC 14 ms 9900 KB
test_15.txt AC 12 ms 9720 KB
test_16.txt AC 14 ms 10512 KB
test_17.txt AC 13 ms 9556 KB
test_18.txt AC 12 ms 9896 KB
test_19.txt AC 12 ms 9808 KB
test_20.txt AC 12 ms 9636 KB
test_21.txt AC 13 ms 10428 KB
test_22.txt AC 12 ms 10192 KB
test_23.txt AC 13 ms 10164 KB
test_24.txt AC 13 ms 10236 KB
test_25.txt AC 12 ms 9632 KB
test_26.txt AC 13 ms 10424 KB
test_27.txt AC 13 ms 10424 KB
test_28.txt AC 13 ms 10192 KB
test_29.txt AC 13 ms 10432 KB
test_30.txt AC 12 ms 9552 KB
test_31.txt AC 13 ms 10428 KB
test_32.txt AC 13 ms 10392 KB
test_33.txt AC 13 ms 10428 KB


2025-03-30 (Sun)
04:48:39 +00:00