Submission #25,179

2026-02-18 11:25:37

cpp17

Accepted 50/50

298ms

18928 KiB

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
	int n; cin>>n;
	vector<ll> nums(n);
	set<ll> be, ki;
	for(int i=0; i<n; i++){
		cin>>nums[i];
		be.insert(nums[i]);
	}
	for(int i=n-1; i>=0; i--){
		ki.insert(nums[i]);
		if(ki.size()==be.size()){
			cout<<i+1; return 0;
		}
	}
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	14ms	1332 KiB
		3	Accepted	5/5	1ms	316 KiB
		4	Accepted	5/5	1ms	316 KiB
		5	Accepted	5/5	64ms	2024 KiB
		6	Accepted	5/5	64ms	2016 KiB
		7	Accepted	4/4	208ms	13720 KiB
		8	Accepted	4/4	234ms	13364 KiB
		9	Accepted	4/4	209ms	11736 KiB
		10	Accepted	4/4	180ms	10548 KiB
		11	Accepted	4/4	173ms	9264 KiB
		12	Accepted	2/2	212ms	10060 KiB
		13	Accepted	2/2	296ms	18928 KiB
		14	Accepted	1/1	298ms	18484 KiB
		15	Accepted	1/1	296ms	18204 KiB
		16	Accepted	1/1	254ms	14900 KiB
		17	Accepted	1/1	211ms	10824 KiB
		18	Accepted	1/1	129ms	2872 KiB
		19	Accepted	1/1	119ms	2348 KiB