164082025-04-29 16:54:50algoproKéséscpp17Wrong answer 0/50280ms18092 KiB
// UUID: 625cd84b-d25c-4b14-b099-6e107c64b4c9
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int>a(n);
	for(int i = 0; i < n;i++){
		cin >> a[i];
	}
	reverse(a.begin(),a.end());
	set<int>szamok(a.begin(),a.end());
	set<int>ki;
	for(int i = 0; i < n;i++){
		ki.insert(a[i]);
		if(ki.size() == szamok.size()){
			cout <<i;
			return 0;
		}
	}
	cout << n;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms316 KiB
2Wrong answer0/014ms1076 KiB
3Wrong answer0/52ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/564ms1244 KiB
6Wrong answer0/564ms1196 KiB
7Wrong answer0/4208ms12972 KiB
8Wrong answer0/4201ms12456 KiB
9Wrong answer0/4182ms11060 KiB
10Wrong answer0/4174ms9780 KiB
11Wrong answer0/4155ms8500 KiB
12Wrong answer0/2199ms9128 KiB
13Wrong answer0/2266ms18092 KiB
14Wrong answer0/1280ms17716 KiB
15Wrong answer0/1273ms17208 KiB
16Wrong answer0/1222ms14132 KiB
17Wrong answer0/1189ms10032 KiB
18Wrong answer0/1128ms2100 KiB
19Wrong answer0/1119ms1588 KiB