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;
void PlayGround() {
int n;
cin >> n;
long long a[n], b[n];
for(int i=0; i<n; ++i) {
cin >> a[i] >> b[i];
}
int lastRem = -1;
int now = 0;
int v = 0;
do {
long long can = max(0LL, a[v]-b[v]);
if(can&1) {
if(can==a[v]) --can;
else ++can;
}
if(can) {
lastRem = now;
}
++now;
a[v] -= can;
v = (v+1)%n;
a[v] += can/2;
} while(now-lastRem<=n);
bool ok = 1;
for(int i=0; i<n; ++i) {
ok &= a[i]==b[i];
}
cout << (ok?"Yes\n":"No\n");
//O(Nlog(max A[i]))
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
PlayGround();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |