164232025-04-29 17:52:21algoproKéséscpp17Wrong answer 0/50252ms9524 KiB
// UUID: 608b2593-b20e-453e-a944-1273161dea19
#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;
	}

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








SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms500 KiB
2Wrong answer0/013ms820 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/561ms1076 KiB
6Wrong answer0/561ms1144 KiB
7Wrong answer0/4200ms6964 KiB
8Wrong answer0/4193ms6932 KiB
9Wrong answer0/4185ms5940 KiB
10Wrong answer0/4168ms5308 KiB
11Wrong answer0/4160ms4656 KiB
12Wrong answer0/2201ms5212 KiB
13Wrong answer0/2243ms9524 KiB
14Wrong answer0/1246ms9272 KiB
15Wrong answer0/1252ms9268 KiB
16Wrong answer0/1217ms7476 KiB
17Wrong answer0/1189ms5580 KiB
18Wrong answer0/1123ms1516 KiB
19Wrong answer0/1114ms1332 KiB