Submission #64068365

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;

char s1[maxn], s[maxn];
int n, nxt[maxn];

int main() {
    scanf("%s", s1+1);
    n = strlen(s1+1);
    strcpy(s+1, s1+1);
    strcpy(s+n+1, s1+1);
    reverse(s+1, s+n+1);
//    cout << s + 1 << endl;

    for (int i = 2, j = 0; i <= 2*n; i++) {
        while (j && s[j+1] != s[i])
            j = nxt[j];
        if (s[j+1] == s[i]) j++;
        nxt[i] = j;
    }
    int m = nxt[2*n];
    if (m >= n)
        puts(s1+1);
    else {
        printf("%s", s1+1);
        for (int i = n-m; i >= 1; i--)
            putchar(s1[i]);
    }

    return 0;
}

Submission Info

Submission Time
Task F - ABCBA
User quanjun
Language C++ 17 (gcc 12.2)
Score 500
Code Size 659 Byte
Status AC
Exec Time 8 ms
Memory 9228 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:9:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    9 |     scanf("%s", s1+1);
      |     ~~~~~^~~~~~~~~~~~

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 3844 KiB
sample_02.txt AC 1 ms 3724 KiB
sample_03.txt AC 1 ms 3652 KiB
test_01.txt AC 1 ms 3796 KiB
test_02.txt AC 1 ms 3860 KiB
test_03.txt AC 1 ms 3600 KiB
test_04.txt AC 1 ms 3840 KiB
test_05.txt AC 1 ms 3728 KiB
test_06.txt AC 1 ms 3584 KiB
test_07.txt AC 1 ms 3604 KiB
test_08.txt AC 1 ms 3588 KiB
test_09.txt AC 1 ms 3804 KiB
test_10.txt AC 8 ms 9172 KiB
test_11.txt AC 8 ms 8948 KiB
test_12.txt AC 8 ms 9032 KiB
test_13.txt AC 8 ms 9228 KiB
test_14.txt AC 7 ms 9092 KiB
test_15.txt AC 6 ms 9168 KiB
test_16.txt AC 8 ms 8968 KiB
test_17.txt AC 6 ms 9016 KiB
test_18.txt AC 7 ms 9224 KiB
test_19.txt AC 6 ms 9156 KiB
test_20.txt AC 6 ms 9160 KiB
test_21.txt AC 8 ms 9176 KiB
test_22.txt AC 7 ms 9212 KiB
test_23.txt AC 7 ms 9168 KiB
test_24.txt AC 7 ms 9160 KiB
test_25.txt AC 6 ms 9160 KiB
test_26.txt AC 8 ms 9092 KiB
test_27.txt AC 8 ms 9168 KiB
test_28.txt AC 7 ms 9164 KiB
test_29.txt AC 8 ms 9208 KiB
test_30.txt AC 6 ms 9208 KiB
test_31.txt AC 8 ms 9096 KiB
test_32.txt AC 8 ms 9168 KiB
test_33.txt AC 8 ms 9168 KiB