# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200792 | dennisstar | 송금 (JOI19_remittance) | C++17 | 480 ms | 24908 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 N, A[1000010], B[1000010], D[1000010];
int main() {
scanf("%d", &N);
for (int i=0; i<N; i++) scanf("%d %d", &A[i], &B[i]), D[i]=A[i]-B[i];
for (int p=0; p<32; p++) for (int i=0; i<N; i++) if (D[i]>0) {
int x=min((D[i]+1)/2, A[i]/2);
A[i]-=x*2, D[i]-=x*2;
A[(i+1)%N]+=x, D[(i+1)%N]+=x;
}
for (int i=0; i<N; i++) if (A[i]!=B[i]) { puts("No"); return 0; }
puts("Yes");
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... |