164112025-04-29 17:02:17algoproKéséscpp17Accepted 50/50219ms9460 KiB
// UUID: 2a4149a5-c809-467e-9b2d-46caf511fb39
#include <bits/stdc++.h>
#include <vector>
using namespace std;

//A maximális int az 2^31-1 ami nagyobb mint 10^9 de kisseb mint 10^10

int main() {
    int n;
	cin >> n;
    map<int,int> k;
    vector<int> g;
    for (int i=0; i<n; i++) {
        int a;
        cin >> a;
        g.push_back(a);
        k[a]++;
    }
    int i =0;
    for (int c :g) {
        k[c]--;
        i++;
        if (k[c]==0) {
            cout << i;
            return 0;
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/010ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/5101ms1420 KiB
6Accepted5/5103ms1440 KiB
7Accepted4/4162ms6964 KiB
8Accepted4/4167ms6848 KiB
9Accepted4/4165ms6056 KiB
10Accepted4/4174ms5536 KiB
11Accepted4/4182ms4992 KiB
12Accepted2/2168ms5032 KiB
13Accepted2/2201ms9460 KiB
14Accepted1/1202ms9380 KiB
15Accepted1/1209ms9128 KiB
16Accepted1/1219ms7596 KiB
17Accepted1/1207ms5848 KiB
18Accepted1/1157ms1704 KiB
19Accepted1/1158ms1704 KiB