# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823870 | 2023-08-13T09:08:55 Z | rainboy | Triangle Collection (CCO23_day2problem3) | C | 57 ms | 1372 KB |
#include <stdio.h> #include <string.h> #define N 2000 int main() { static int aa[N], aa_[N]; int n, q, i, j, d, k, ans; scanf("%d%d", &n, &q); for (i = 0; i < n; i++) scanf("%d", &aa[i]); while (q--) { scanf("%d%d", &i, &d), i--; aa[i] += d; memcpy(aa_, aa, n * sizeof *aa); ans = 0; for (i = n - 1, j = n - 1; i >= 0; i--) while (aa_[i] >= 2) { while (j >= 0 && (j > i * 2 || aa_[j] % 2 == 0)) j--; if (j >= 0) ans++, aa_[i] -= 2, aa_[j]--; else { k = 0; while (i >= 0) k += aa_[i], i--; ans += k / 3; break; } } printf("%d\n", ans); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 236 KB | Output is correct |
4 | Correct | 1 ms | 300 KB | Output is correct |
5 | Correct | 1 ms | 296 KB | Output is correct |
6 | Correct | 19 ms | 316 KB | Output is correct |
7 | Correct | 20 ms | 296 KB | Output is correct |
8 | Correct | 12 ms | 212 KB | Output is correct |
9 | Correct | 20 ms | 328 KB | Output is correct |
10 | Correct | 20 ms | 324 KB | Output is correct |
11 | Correct | 15 ms | 212 KB | Output is correct |
12 | Correct | 13 ms | 332 KB | Output is correct |
13 | Correct | 6 ms | 308 KB | Output is correct |
14 | Correct | 6 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 236 KB | Output is correct |
4 | Correct | 1 ms | 300 KB | Output is correct |
5 | Correct | 1 ms | 296 KB | Output is correct |
6 | Correct | 19 ms | 316 KB | Output is correct |
7 | Correct | 20 ms | 296 KB | Output is correct |
8 | Correct | 12 ms | 212 KB | Output is correct |
9 | Correct | 20 ms | 328 KB | Output is correct |
10 | Correct | 20 ms | 324 KB | Output is correct |
11 | Correct | 15 ms | 212 KB | Output is correct |
12 | Correct | 13 ms | 332 KB | Output is correct |
13 | Correct | 6 ms | 308 KB | Output is correct |
14 | Correct | 6 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 288 KB | Output is correct |
16 | Incorrect | 0 ms | 212 KB | Output isn't correct |
17 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 328 KB | Output is correct |
2 | Correct | 17 ms | 332 KB | Output is correct |
3 | Correct | 57 ms | 1372 KB | Output is correct |
4 | Runtime error | 1 ms | 340 KB | Execution killed with signal 11 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 360 KB | Output is correct |
2 | Incorrect | 9 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 236 KB | Output is correct |
4 | Correct | 1 ms | 300 KB | Output is correct |
5 | Correct | 1 ms | 296 KB | Output is correct |
6 | Correct | 19 ms | 316 KB | Output is correct |
7 | Correct | 20 ms | 296 KB | Output is correct |
8 | Correct | 12 ms | 212 KB | Output is correct |
9 | Correct | 20 ms | 328 KB | Output is correct |
10 | Correct | 20 ms | 324 KB | Output is correct |
11 | Correct | 15 ms | 212 KB | Output is correct |
12 | Correct | 13 ms | 332 KB | Output is correct |
13 | Correct | 6 ms | 308 KB | Output is correct |
14 | Correct | 6 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 288 KB | Output is correct |
16 | Incorrect | 0 ms | 212 KB | Output isn't correct |
17 | Halted | 0 ms | 0 KB | - |