| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1229195 | 12345678 | Infinite Race (EGOI24_infiniterace2) | C++20 | 12 ms | 1224 KiB |
#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
int n, q, ver[nx], x, ans;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>q;
for (int i=1; i<n; i++) ver[i]=-1;
while (q--)
{
cin>>x;
if (x>0)
{
if (ver[x]!=ans) ver[x]=ans;
else ans++, ver[x]=ans;
}
else
{
x=-x;
if (ver[x]==ans) ver[x]=-1;
}
//cout<<"ans "<<ans<<'\n';
}
cout<<ans;
}| # | 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... | ||||
