Submission #74113996

Source Code Expand

N, L, R = list(map(int, input().split()))
S = input()

cnt = 0
for l in range(0, N-L):
    for r in range(L, R+1):
        if (l + r) >= N:
            break
        if(S[l] == S[l+r]):
            cnt += 1
print(cnt)

Submission Info

Submission Time
Task C - Comfortable Distance
User MatsumotoT
Language Python (CPython 3.13.7)
Score 0
Code Size 233 Byte
Status TLE
Exec Time > 2000 ms
Memory 10476 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 9
TLE × 14
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt
Case Name Status Exec Time Memory
sample00.txt AC 11 ms 9148 KiB
sample01.txt AC 12 ms 9260 KiB
sample02.txt AC 11 ms 9176 KiB
testcase00.txt AC 12 ms 9148 KiB
testcase01.txt AC 12 ms 9128 KiB
testcase02.txt TLE > 2000 ms 9308 KiB
testcase03.txt TLE > 2000 ms 10476 KiB
testcase04.txt TLE > 2000 ms 9688 KiB
testcase05.txt TLE > 2000 ms 9812 KiB
testcase06.txt TLE > 2000 ms 9360 KiB
testcase07.txt TLE > 2000 ms 10340 KiB
testcase08.txt TLE > 2000 ms 10320 KiB
testcase09.txt TLE > 2000 ms 10124 KiB
testcase10.txt TLE > 2000 ms 10316 KiB
testcase11.txt TLE > 2000 ms 10120 KiB
testcase12.txt AC 146 ms 10212 KiB
testcase13.txt TLE > 2000 ms 10264 KiB
testcase14.txt AC 13 ms 10292 KiB
testcase15.txt TLE > 2000 ms 10240 KiB
testcase16.txt AC 131 ms 10324 KiB
testcase17.txt TLE > 2000 ms 10276 KiB
testcase18.txt AC 12 ms 10320 KiB
testcase19.txt TLE > 2000 ms 10272 KiB