(cache)Submission #64080761 - UNIQUE VISION Programming Contest 2025 Spring (AtCoder Beginner Contest 398)

Contest Duration: 2025-03-22(Sat) 21:00 - 2025-03-22(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #64080761

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def manacher(S):
    C = []
    for a in S:
        C.append(a)
        C.append(0)
    C.pop()
    L = len(C)
    R = [0]*L
    i = j = 0
    while i < L:
        while j <= i < L-j and C[i-j] == C[i+j]:
            j += 1
        R[i] = j
        k = 1
        while j-R[i-k] > k <= i < L-k:
            R[i+k] = R[i-k]
            k += 1
        i += k; j -= k
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def manacher(S):
    C = []
    for a in S:
        C.append(a)
        C.append(0)
    C.pop()

    L = len(C)

    R = [0]*L

    i = j = 0
    while i < L:
        while j <= i < L-j and C[i-j] == C[i+j]:
            j += 1
        R[i] = j
        k = 1
        while j-R[i-k] > k <= i < L-k:
            R[i+k] = R[i-k]
            k += 1
        i += k; j -= k

    for i in range(L):
        if i & 1 == R[i] & 1:
            R[i] -= 1
    return max(R)

def f(S):
    if S==S[::-1]:
        return True
    return False

S=input()
x=manacher(S)
#print(x)
if f(S[-x:]):
    T=S[:-x]
    print(S+T[::-1])
        
else:
    x=1
    T=S[:-x]
    print(S+T[::-1])

Submission Info

Submission Time	2025-03-22 21:57:37
Task	F - ABCBA
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	735 Byte
Status	WA
Exec Time	160 ms
Memory	163868 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 500

Status

× 3

AC	× 31
WA	× 5

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	57 ms	76664 KiB
sample_02.txt	AC	57 ms	76292 KiB
sample_03.txt	AC	58 ms	76232 KiB
test_01.txt	AC	58 ms	76356 KiB
test_02.txt	AC	58 ms	76432 KiB
test_03.txt	AC	60 ms	76600 KiB
test_04.txt	AC	59 ms	76288 KiB
test_05.txt	AC	58 ms	76304 KiB
test_06.txt	AC	58 ms	76672 KiB
test_07.txt	AC	58 ms	76448 KiB
test_08.txt	AC	58 ms	76292 KiB
test_09.txt	AC	58 ms	76440 KiB
test_10.txt	AC	152 ms	155464 KiB
test_11.txt	AC	154 ms	155540 KiB
test_12.txt	AC	150 ms	155552 KiB
test_13.txt	WA	149 ms	155072 KiB
test_14.txt	AC	147 ms	154568 KiB
test_15.txt	AC	147 ms	153388 KiB
test_16.txt	WA	149 ms	155176 KiB
test_17.txt	AC	147 ms	153812 KiB
test_18.txt	AC	151 ms	154428 KiB
test_19.txt	AC	149 ms	153824 KiB
test_20.txt	AC	147 ms	153936 KiB
test_21.txt	WA	149 ms	155188 KiB
test_22.txt	AC	149 ms	154728 KiB
test_23.txt	AC	150 ms	154748 KiB
test_24.txt	AC	152 ms	154800 KiB
test_25.txt	AC	160 ms	163868 KiB
test_26.txt	WA	151 ms	155080 KiB
test_27.txt	AC	149 ms	155224 KiB
test_28.txt	AC	148 ms	154468 KiB
test_29.txt	AC	150 ms	154908 KiB
test_30.txt	AC	148 ms	153732 KiB
test_31.txt	WA	150 ms	155172 KiB
test_32.txt	AC	149 ms	154896 KiB
test_33.txt	AC	150 ms	154656 KiB