231602026-01-16 14:41:31Leventusz09Késéscpp17Accepted 50/50199ms9780 KiB
#include <iostream>
#include <set>

using namespace std;

int main(){
    int N;
    cin >> N;
    int E[N];
    bool O[N];
    for(int i=0; i<N; O[i++] = 0) cin >> E[i];

    set<int> S;

    for(int i=N-1; i>=0; i--){
        if(S.find(E[i]) == S.end()){
            // nem van benne
            S.insert(E[i]);
            O[i] = 1;
        }
    }

    //for(int i=0; i<N; i++) cout << O[i] << " ";
    //cout << endl;

    for(int i=0; i<N; i++){
        if(O[i]){
            cout << i +1 << endl;
            return 0;
        }
    }
    cout << 1 << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/010ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/567ms1340 KiB
6Accepted5/568ms1360 KiB
7Accepted4/4152ms7188 KiB
8Accepted4/4153ms7064 KiB
9Accepted4/4149ms6196 KiB
10Accepted4/4143ms5684 KiB
11Accepted4/4137ms4920 KiB
12Accepted2/2165ms5320 KiB
13Accepted2/2199ms9780 KiB
14Accepted1/1197ms9524 KiB
15Accepted1/1199ms9268 KiB
16Accepted1/1185ms7760 KiB
17Accepted1/1168ms5684 KiB
18Accepted1/1127ms1844 KiB
19Accepted1/1119ms1588 KiB