164452025-04-30 17:03:27algoproKéséscpp17Accepted 50/50287ms18740 KiB
// UUID: 2485d7dc-0e33-4c92-b018-ac7c6217f84f
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    vector<long long> es (n);
    set<long long> b;
    for (int i = n-1; i >= 0; i--) {
        cin >> es[i];
        b.insert(es[i]);
    }
    int size = b.size();
    set<long long> a;
    for (int i = 0; i < n; i++) {
        a.insert(es[i]);
        if (a.size() == size) {
            cout << n-i;
            return 0;
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms320 KiB
2Accepted0/013ms1344 KiB
3Accepted5/52ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/561ms2024 KiB
6Accepted5/561ms2032 KiB
7Accepted4/4216ms13800 KiB
8Accepted4/4199ms13432 KiB
9Accepted4/4194ms11872 KiB
10Accepted4/4172ms10520 KiB
11Accepted4/4163ms9336 KiB
12Accepted2/2202ms9888 KiB
13Accepted2/2264ms18740 KiB
14Accepted1/1287ms18484 KiB
15Accepted1/1282ms18228 KiB
16Accepted1/1226ms14900 KiB
17Accepted1/1197ms10700 KiB
18Accepted1/1128ms2868 KiB
19Accepted1/1116ms2356 KiB