Submission #50565226

Source Code Expand

#ABC342_20240224_A
S=input()
D={}
for i in range(len(S)):
    if(S[i] not in D):
        D[S[i]]=i+1
    else:
        D[S[i]]=-1
ans=list(D.values())
print(max(ans))

Submission Info

Submission Time
Task A - Yay!
User Konini
Language Python (PyPy 3.10-v7.3.12)
Score 150
Code Size 177 Byte
Status AC
Exec Time 56 ms
Memory 76756 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 150 / 150
Status
AC × 3
AC × 13
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 55 ms 76632 KiB
00_sample_02.txt AC 55 ms 76700 KiB
00_sample_03.txt AC 56 ms 76724 KiB
01_test_01.txt AC 56 ms 76564 KiB
01_test_02.txt AC 55 ms 76312 KiB
01_test_03.txt AC 56 ms 76376 KiB
01_test_04.txt AC 55 ms 76480 KiB
01_test_05.txt AC 56 ms 76168 KiB
01_test_06.txt AC 56 ms 76756 KiB
01_test_07.txt AC 55 ms 76420 KiB
01_test_08.txt AC 55 ms 76304 KiB
01_test_09.txt AC 55 ms 76304 KiB
01_test_10.txt AC 55 ms 76264 KiB