#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |