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;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 1000005;
int n;
pii a[MN * 2];
int32_t main() {
boost();
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i].f >> a[i].s;
for (int t = 0; t < 32; t++) { //wtf???
for (int i = 0; i < n; i++) {
if (a[i].s < a[i].f) {
int d = (a[i].f - a[i].s + 1) / 2;
a[i].f -= d * 2;
a[(i + 1) % n].f += d;
}
}
}
for (int i = 0; i < MN * 2; i++) if (a[i].f != a[i].s) return 0 * printf("No\n");
printf("Yes\n");
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... |