This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
map<int,int>m;
int n, q, x, r;
bool a[200001], b[200001];
int main()
{
cin >> n >> q;
set<int> st;
int ind =0;
for(int i=1;i<=q;i++)
{
int x;
cin>>x;
if(x>0)
{
if(st.find(x)!=st.end())
{
ind++;
st.clear();
st.insert(x);
}
else
st.insert(x);
}
else
{
st.erase(-x);
}
}
cout <<ind;
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... |