| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1309551 | Newtonabc | Infinite Race (EGOI24_infiniterace2) | C++20 | 1095 ms | 752 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;
while(q--){
int x;
cin>>x;
if(x<0){
x=-x;
st[x]=0;
}
else{
if(st[x]==0) st[x]=1;
else{
acc++;
for(int i=1;i<=n;i++) if(i!=x) st[i]=0;
}
}
}
//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... | ||||
