Submission #16,409

2025-04-29 16:56:13

cpp17

Accepted 50/50

298ms

18092 KiB

// UUID: 774e2c5a-786b-4885-842f-f43d56e073b1
#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 <<n-i;
			return 0;
		}
	}
	cout << 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	504 KiB
		2	Accepted	0/0	13ms	1076 KiB
		3	Accepted	5/5	1ms	316 KiB
		4	Accepted	5/5	2ms	316 KiB
		5	Accepted	5/5	61ms	1196 KiB
		6	Accepted	5/5	61ms	1200 KiB
		7	Accepted	4/4	218ms	12976 KiB
		8	Accepted	4/4	196ms	12596 KiB
		9	Accepted	4/4	199ms	11052 KiB
		10	Accepted	4/4	166ms	9896 KiB
		11	Accepted	4/4	158ms	8492 KiB
		12	Accepted	2/2	194ms	9128 KiB
		13	Accepted	2/2	268ms	18092 KiB
		14	Accepted	1/1	270ms	17576 KiB
		15	Accepted	1/1	298ms	17460 KiB
		16	Accepted	1/1	221ms	14132 KiB
		17	Accepted	1/1	200ms	10028 KiB
		18	Accepted	1/1	123ms	2100 KiB
		19	Accepted	1/1	114ms	1588 KiB