# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
610973 | Plurm | Remittance (JOI19_remittance) | C++11 | 1 ms | 340 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 <bits/stdc++.h>
using namespace std;
int a[1000005];
int b[1000005];
int main() {
int n;
scanf("%d", &n);
bool idenzero = true;
for (int i = 1; i <= n; i++) {
scanf("%d%d", a + i, b + i);
if (b[i])
idenzero = false;
}
for (int it = 0; it < 100; it++) {
for (int i = 1; i <= n; i++) {
if (a[i] > b[i]) {
int transfer = (a[i] - b[i] + 1) / 2;
a[i] -= 2 * transfer;
a[i % n + 1] += transfer;
}
}
}
bool ok = true;
for (int i = 1; i <= n; i++) {
if (a[i] != b[i])
ok = false;
}
printf(ok ? "Yes\n" : "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... |