# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677657 | Cross_Ratio | Remittance (JOI19_remittance) | C++14 | 301 ms | 32640 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;
typedef pair<int,int> P;
int A[1000005];
int B[1000005];
signed main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
int i, j;
for(i=0;i<N;i++) cin >> A[i] >> B[i];
queue<int> Q;
for(i=0;i<N;i++) {
if(A[i] > B[i]+1) {
Q.push(i);
}
}
while(!Q.empty()) {
int id = Q.front();
Q.pop();
if(A[id] <= B[id]+1) continue;
int v = A[id] - B[id];
v /= 2;
A[id] -= v*2;
A[(id+1)%N] += v;
if(A[(id+1)%N]>B[(id+1)%N]+1) {
Q.push((id+1)%N);
}
}
bool isPos1 = true;
bool isPos2 = false;
for(i=0;i<N;i++) {
if(A[i]>=2) isPos2 = true;
}
for(i=0;i<N;i++) {
if(A[i]!=B[i]) isPos1 = false;
if(A[i]!=B[i]+1) isPos2 = false;
assert(A[i]<B[i]+2);
}
cout << (isPos1||isPos2?"Yes":"No");
}
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... |