163772025-04-29 10:14:59algoproKéséspypy3Accepted 50/50186ms57744 KiB
# UUID: 35b707e3-5938-4722-a5b7-ebe449d50e3e
N=int(input())
A=input().split()
#A=list(map(int,input().split()))
S=len(set(A))

X = set()
for i in range(N-1,-1,-1):
    X.add(A[i])
    if len(X)==S:
        print(i+1)
        break
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/043ms19272 KiB
2Accepted0/057ms21928 KiB
3Accepted5/541ms19636 KiB
4Accepted5/541ms19824 KiB
5Accepted5/596ms39408 KiB
6Accepted5/593ms39404 KiB
7Accepted4/4136ms50776 KiB
8Accepted4/4136ms50624 KiB
9Accepted4/4149ms48596 KiB
10Accepted4/4143ms46744 KiB
11Accepted4/4116ms43704 KiB
12Accepted2/2138ms49132 KiB
13Accepted2/2186ms57744 KiB
14Accepted1/1155ms57704 KiB
15Accepted1/1171ms55808 KiB
16Accepted1/1136ms52868 KiB
17Accepted1/1125ms50004 KiB
18Accepted1/1104ms42732 KiB
19Accepted1/1108ms42964 KiB