# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238593 | Jer | Infinite Race (EGOI24_infiniterace2) | C++20 | 72 ms | 10568 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int laps[MAXN];
int n, q;
int main()
{
scanf("%d%d", &n, &q);
fill(laps, laps + n, 0);
map<int, int> laps;
int a, res = 0;
while (q--)
{
scanf("%d", &a);
if (a > 0)
{
if (laps[a] == 1)
res++, laps.clear();
laps[a] += 1;
}
else
laps[-a] = 0;
}
printf("%d\n", res);
return 0;
}
Compilation message (stderr)
# | 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... |