| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1309552 | Newtonabc | Infinite Race (EGOI24_infiniterace2) | C++20 | 105 ms | 9644 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
bool st[N];
int cnt[N];
int main(){
int n,q,acc=0;
cin>>n >>q;
set<int> s;
while(q--){
int x;
cin>>x;
if(x<0){
x=-x;
s.erase(x);
}
else{
if(s.find(x)==s.end()) s.insert(x);
else{
acc++;
s.clear();
s.insert(x);
}
}
}
//for(int i=1;i<=n;i++) cout<<cnt[i] <<" ";
cout<<acc;
}| # | 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... | ||||
