Submission #16,425

2025-04-29 17:57:50

cpp17

Accepted 50/50

259ms

9524 KiB

// UUID: 3fd24ed6-fc0f-45a5-a06e-42d15e5832d1
#include <bits/stdc++.h>
using namespace std;
set<int> szamok;
vector<int> sor;
int main() {
	int n; cin >> n; sor.resize(n);
	
	int e;
	int i=0;
	for (;i<n;i++)
	{
		cin>>e;
		szamok.insert(e);
		sor[i]=e;
	}

	int m=szamok.size();
	if (n==szamok.size())
	{
		cout<<0;
		return 0;
	}

	i = n;
	while (szamok.size() !=0)
	{
		i--;
		szamok.erase(sor[i]);
	} 
	cout<<i+1;
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	500 KiB
		2	Accepted	0/0	13ms	820 KiB
		3	Accepted	5/5	1ms	508 KiB
		4	Accepted	5/5	1ms	316 KiB
		5	Accepted	5/5	61ms	1268 KiB
		6	Accepted	5/5	63ms	1080 KiB
		7	Accepted	4/4	206ms	7052 KiB
		8	Accepted	4/4	194ms	6860 KiB
		9	Accepted	4/4	181ms	5936 KiB
		10	Accepted	4/4	175ms	5372 KiB
		11	Accepted	4/4	162ms	4660 KiB
		12	Accepted	2/2	203ms	5168 KiB
		13	Accepted	2/2	246ms	9524 KiB
		14	Accepted	1/1	254ms	9260 KiB
		15	Accepted	1/1	259ms	9272 KiB
		16	Accepted	1/1	216ms	7640 KiB
		17	Accepted	1/1	193ms	5428 KiB
		18	Accepted	1/1	125ms	1588 KiB
		19	Accepted	1/1	115ms	1332 KiB