# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078320 | horiaboeriu | Infinite Race (EGOI24_infiniterace2) | C++17 | 17 ms | 1808 KiB |
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 <stdio.h>
#include <stdlib.h>
#define MAXN 200000
char f[MAXN];//in f[x] este 0 daca x este in fata si 1 daca ea este in fata pe teren
int main()
{
int n, q, i, x, rez, ul;
scanf("%d%d", &n, &q);
rez = ul = 0;
for (i = 0; i < q; i++) {
scanf("%d", &x);
if (x < 0) {
f[-x] = 0;
} else {
if (f[x] > 0) {
if (ul == x || ul == 0) {
rez++;
}
//acum il intrece doar pe x, deci da o tura intreaga si restul din fata ei raman in fata si cele din spate dupa ce face tura vor ajunge in fata
ul = x;
}
f[x] = 1;
}
}
printf("%d\n", rez);
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... |