Submission #1148200

#TimeUsernameProblemLanguageResultExecution timeMemory
1148200UmairAhmadMirzaInfinite Race (EGOI24_infiniterace2)C++20
100 / 100
105 ms9800 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=2e5+5;
int const mod=1e9+7;



int main(){
	int n;
	cin>>n;
	int q;
	cin>>q;
	set<int> bh;
	int ans=0;
	while(q--){
		int x;
		cin>>x;
		if(x>0){
			if(bh.find(x)!=bh.end()){
				ans++;
				bh.clear();
				bh.insert(x);
			}
			else{
				bh.insert(x);
			}
		}
		else{
			x*=-1;
			if(bh.find(x)!=bh.end())
				bh.erase(x);
		}
	}
	cout<<ans<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...