# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078318 | 2024-08-27T15:15:52 Z | horiaboeriu | Infinite Race (EGOI24_infiniterace2) | C++17 | 11 ms | 860 KB |
#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) { 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 432 KB | Output is correct |
4 | Incorrect | 11 ms | 860 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 432 KB | Output is correct |
4 | Incorrect | 11 ms | 860 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |