Submission details
Task:Longest palindrome
Sender:aalto26iw_007
Submission time:2026-11-04 17:48:32 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#10.04 sdetails
#2ACCEPTED0.04 sdetails
#3--details
#4--details
#5--details
#6--details
#7--details
#8--details
#90.04 sdetails
#100.04 sdetails
#11--details
#120.04 sdetails
#13ACCEPTED0.04 sdetails
#140.04 sdetails
#150.04 sdetails
#16--details

Code

s = input()
n = len(s)

m = 1 << 128
g = 5
inv = pow(g, -1, m)

h1 = [0 for i in range(n)]
h2 = [0 for j in range(n)]

p = 1
for i in range(n):
	if i > 0:
		h1[i] = h1[i-1]
		h2[i] = h2[i-1]
	h1[i] = (h1[i]+p*ord(s[i])) % m
	h2[i] = (h2[i]+p*ord(s[n-1-i])) % m
	p = (g*p) % m

def val(i, j, h):
	v = h[j]
	if i > 0:
		v -= h[i-1]
	return (v*pow(inv, i, m)) % m

def ispal(i, j):
	return val(i, j, h1) == val(n-j-1, n-i-1, h2)

#print(h1, h2)
#print(val(2, 4, h1), ispal(2, 4))
#or i in range(n):
#	for j in range(i, n):
#		print(ispal(i, j), end=" ")
#	print()


def ma(i):
	lo = 0
	hi = min(i, n-1-i)+1
	ans = 0
	while lo < hi:
		mid = (lo + hi) // 2
		if ispal(i-mid, i+mid):
			ans = mid
			lo = mid+1
		else:
			hi = mid-1
	return ans


mfound = 0
index = 0

for i in range(1, n):
	v = ma(i)
	if v > mfound:
		mfound = v
		index = i

print(s[index-mfound:index+mfound+1])


	

Test details

Test 1

Verdict:

input
aaaaaaaaaa

correct output
aaaaaaaaaa

user output
aaaaaaaaa

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:

input
ihpohpzoffel

correct output
ff

user output
i

Test 10

Verdict:

input
flexflexvpqxierullgcfckjqflexf...

correct output
cfc

user output
f

Test 11

Verdict:

input
aabbabaabbaababbabaababbaabbab...

correct output
abaababbaabbabaababbabaabbaaba...

user output
(empty)

Test 12

Verdict:

input
obsession

correct output
ses

user output
o

Test 13

Verdict: ACCEPTED

input
abcxcbaxcba

correct output
abcxcba

user output
abcxcba

Test 14

Verdict:

input
zzabc

correct output
zz

user output
z

Test 15

Verdict:

input
aaccaabbaaccaaccaabbaaccaa

correct output
aaccaabbaaccaaccaabbaaccaa

user output
a

Test 16

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

user output
(empty)