(cache)Submission #64082754 - 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 #64082754

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 R


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

S=input()

A=manacher(S)
#print(A)
N=len(A)
A.reverse()
x=A[0]
for i in range(1,N):
    if A[i-1]<A[i]:
        x=A[i]
    else:
        break
        
T=S[:-x]
print(S+T[::-1])

Submission Info

Submission Time	2025-03-22 22:01:15
Task	F - ABCBA
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	789 Byte
Status	WA
Exec Time	159 ms
Memory	163824 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 500

Status

× 3

AC	× 16
WA	× 20

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	58 ms	76664 KiB
sample_02.txt	AC	58 ms	76448 KiB
sample_03.txt	AC	59 ms	76460 KiB
test_01.txt	AC	59 ms	76452 KiB
test_02.txt	AC	59 ms	76664 KiB
test_03.txt	AC	58 ms	76352 KiB
test_04.txt	AC	58 ms	76620 KiB
test_05.txt	AC	59 ms	76472 KiB
test_06.txt	WA	60 ms	76736 KiB
test_07.txt	AC	58 ms	76640 KiB
test_08.txt	AC	58 ms	76476 KiB
test_09.txt	AC	58 ms	76744 KiB
test_10.txt	AC	149 ms	155076 KiB
test_11.txt	AC	150 ms	154980 KiB
test_12.txt	AC	149 ms	154968 KiB
test_13.txt	WA	151 ms	155016 KiB
test_14.txt	WA	149 ms	155032 KiB
test_15.txt	WA	147 ms	155036 KiB
test_16.txt	AC	149 ms	154812 KiB
test_17.txt	WA	148 ms	155204 KiB
test_18.txt	WA	149 ms	155084 KiB
test_19.txt	WA	150 ms	155464 KiB
test_20.txt	WA	148 ms	155404 KiB
test_21.txt	AC	149 ms	155196 KiB
test_22.txt	WA	149 ms	155160 KiB
test_23.txt	WA	148 ms	154780 KiB
test_24.txt	WA	149 ms	155068 KiB
test_25.txt	WA	159 ms	163824 KiB
test_26.txt	WA	149 ms	155244 KiB
test_27.txt	WA	149 ms	155152 KiB
test_28.txt	WA	149 ms	155076 KiB
test_29.txt	WA	150 ms	155052 KiB
test_30.txt	WA	150 ms	155296 KiB
test_31.txt	WA	152 ms	154776 KiB
test_32.txt	WA	149 ms	155208 KiB
test_33.txt	WA	148 ms	154820 KiB