# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078297 | 2024-08-27T14:59:52 Z | horiaboeriu | Infinite Race (EGOI24_infiniterace2) | C++17 | 21 ms | 1844 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 rez[MAXN]; int main() { int n, q, i, x; scanf("%d%d", &n, &q); for (i = 0; i < q; i++) { scanf("%d", &x); if (x < 0) { f[-x] = 0; } else { if (f[x] > 0) { rez[x]++; } f[x] = 1; } } x = 0; for (i = 1; i < n; i++) { if (rez[i] > x) { x = rez[i]; } } printf("%d\n", x); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 14 ms | 920 KB | Output is correct |
5 | Correct | 13 ms | 912 KB | Output is correct |
6 | Correct | 20 ms | 768 KB | Output is correct |
7 | Correct | 21 ms | 860 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 12 ms | 604 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 14 ms | 860 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 13 ms | 860 KB | Output is correct |
15 | Correct | 0 ms | 344 KB | Output is correct |
16 | Correct | 12 ms | 860 KB | Output is correct |
17 | Correct | 0 ms | 352 KB | Output is correct |
18 | Correct | 13 ms | 820 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 11 ms | 784 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 1844 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Incorrect | 18 ms | 604 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Incorrect | 0 ms | 348 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 14 ms | 920 KB | Output is correct |
5 | Correct | 13 ms | 912 KB | Output is correct |
6 | Correct | 20 ms | 768 KB | Output is correct |
7 | Correct | 21 ms | 860 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 12 ms | 604 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 14 ms | 860 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 13 ms | 860 KB | Output is correct |
15 | Correct | 0 ms | 344 KB | Output is correct |
16 | Correct | 12 ms | 860 KB | Output is correct |
17 | Correct | 0 ms | 352 KB | Output is correct |
18 | Correct | 13 ms | 820 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
21 | Correct | 0 ms | 348 KB | Output is correct |
22 | Correct | 11 ms | 784 KB | Output is correct |
23 | Correct | 0 ms | 348 KB | Output is correct |
24 | Correct | 0 ms | 348 KB | Output is correct |
25 | Correct | 15 ms | 1844 KB | Output is correct |
26 | Correct | 0 ms | 348 KB | Output is correct |
27 | Incorrect | 18 ms | 604 KB | Output isn't correct |
28 | Halted | 0 ms | 0 KB | - |