# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337322 | spatarel | Remittance (JOI19_remittance) | C++17 | 310 ms | 28652 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>
int main() {
int n;
scanf("%d", &n);
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
scanf("%d%d", &a[i], &b[i]);
}
int counter = 0;
for (int i = 0; counter < n; i = (i + 1) % n) {
int remittance = (a[i] - b[i]) / 2;
if (remittance > 0) {
a[i] -= 2 * remittance;
a[(i + 1) % n] += remittance;
counter = 0;
} else {
counter++;
}
}
bool ok1 = true;
bool ok2 = false;
for (int i = 0; i < n; i++) {
ok2 |= a[i] > 1;
}
for (int i = 0; i < n; i++) {
ok1 &= (a[i] == b[i]);
ok2 &= (a[i] - 1 == b[i]);
}
if (ok1 || ok2) {
printf("Yes\n");
} else {
printf("No\n");
}
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... |