164432025-04-30 16:58:43algoproKéséscpp17Accepted 50/50287ms18736 KiB
// UUID: f9a797bd-b84c-4ca5-a392-dde170d6a032
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main() {
    long long n;
    cin >> n;
    vector<long long> v(n);
    for(long long i = 0; i < n; i++) cin >> v[i];
    set<long long> s1;
    for(long long i = 0; i < n ; i++) s1.insert(v[i]);
    set<long long> s2;
    for(long long i = n - 1; i >= 0; i--){
        s2.insert(v[i]);
        if(s2.size() == s1.size()) {
            cout << i + 1;
            return 0;
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/013ms1328 KiB
3Accepted5/51ms316 KiB
4Accepted5/52ms316 KiB
5Accepted5/564ms1980 KiB
6Accepted5/563ms1976 KiB
7Accepted4/4196ms13632 KiB
8Accepted4/4202ms13240 KiB
9Accepted4/4187ms11828 KiB
10Accepted4/4165ms10548 KiB
11Accepted4/4151ms9144 KiB
12Accepted2/2202ms9920 KiB
13Accepted2/2287ms18736 KiB
14Accepted1/1266ms18484 KiB
15Accepted1/1277ms18228 KiB
16Accepted1/1224ms14900 KiB
17Accepted1/1182ms10676 KiB
18Accepted1/1125ms2868 KiB
19Accepted1/1115ms2232 KiB