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>
typedef long long ll;
using namespace std;
const int MAX = 1000007;
ll A[MAX], B[MAX];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N;
cin >> N;
for (int i = 0; i < N; ++i) cin >> A[i] >> B[i];
for (int t = 0; t < 30; ++t) {
if (50 <= N && t == 2) break;
for (int i = 0; i < N; ++i) {
if (A[i] <= B[i]) continue;
ll z = A[i] - B[i];
if (z % 2 && B[i]) z++;
A[i] -= z / 2LL * 2;
A[(i + 1) % N] += z / 2LL;
}
}
for (int i = 0; i < N; ++i) {
if (A[i] == B[i]) continue;
cout << "No";
return 0;
}
cout << "Yes";
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... |