# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823870 | rainboy | Triangle Collection (CCO23_day2problem3) | C11 | 57 ms | 1372 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 <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;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |