164162025-04-29 17:25:03algoproKéséspypy3Accepted 50/50144ms62904 KiB
# UUID: 9a161718-6240-4429-8079-5a0d4b11b1c0
n = int(input())
sor = [int(x) for x in input().split()]
megoldas = 0
halmaz = set()
for i in range(n-1,-1,-1):
    mostaniszám = sor[i]
    if mostaniszám not in halmaz:
        megoldas = i
    #else:
    #    megoldas += 1
    halmaz.add(mostaniszám)
print(megoldas + 1)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/043ms19400 KiB
2Accepted0/054ms22676 KiB
3Accepted5/541ms19872 KiB
4Accepted5/546ms19772 KiB
5Accepted5/5101ms39300 KiB
6Accepted5/5101ms39244 KiB
7Accepted4/4109ms52448 KiB
8Accepted4/4108ms52384 KiB
9Accepted4/4126ms50372 KiB
10Accepted4/4122ms48608 KiB
11Accepted4/4101ms45752 KiB
12Accepted2/2111ms52320 KiB
13Accepted2/2143ms62796 KiB
14Accepted1/1122ms62904 KiB
15Accepted1/1144ms62640 KiB
16Accepted1/1119ms60100 KiB
17Accepted1/1112ms53956 KiB
18Accepted1/1105ms44276 KiB
19Accepted1/194ms44420 KiB