163252025-04-28 17:27:57algoproKéséscpp17Wrong answer 0/50305ms9476 KiB
// UUID: a5ac1509-0b14-4783-9a80-32e6850a558a
#include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <vector>
using namespace std;

int main() {
	int n, ans; cin >> n;
    vector<int> szamok(n, 0);
    map<int, int> vis;
    for (int i=0;i<n;i++){
        cin >> szamok[i];
        vis[szamok[i]] = 0;
    }
    reverse(szamok.begin(), szamok.end());
    for (int i=0;i<n;i++) {
        if (!vis[szamok[i]]) {
            ans = i;
            vis[szamok[i]] = 1;
            // cout << i << 'a' << endl;
        }
    }   
    cout << ans << '\n';
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms500 KiB
2Wrong answer0/014ms820 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/582ms1076 KiB
6Wrong answer0/582ms1076 KiB
7Wrong answer0/4230ms6948 KiB
8Wrong answer0/4224ms6708 KiB
9Wrong answer0/4226ms5940 KiB
10Wrong answer0/4207ms5428 KiB
11Wrong answer0/4199ms4744 KiB
12Wrong answer0/2231ms5132 KiB
13Wrong answer0/2287ms9476 KiB
14Wrong answer0/1305ms9452 KiB
15Wrong answer0/1284ms9324 KiB
16Wrong answer0/1272ms7476 KiB
17Wrong answer0/1238ms5432 KiB
18Wrong answer0/1155ms1588 KiB
19Wrong answer0/1143ms1336 KiB