#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)size(x)
#define all(x) (x).begin(), (x).end()
void solve(){
int n, q;
cin >> n >> q;
set<int> s;
int ans = 0;
for(int i = 0; i < q; i++){
int x;
cin >> x;
if(x > 0){
if(s.count(x)){
ans++;
s.clear();
s.insert(x);
}
else s.insert(x);
}
else{
s.erase(-x);
}
}
cout << ans << "\n";
}
int main(){
cin.tie(0)->sync_with_stdio(false);
solve();
}
# | 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... |