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>
#pragma GCC optimize("O2")
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
#define endl '\n'
int n;
const int N = 1e6 + 5;
int d[N];
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
d[i] = a - b;
}
}
void solve() {
for (int t = 0; t < 60; t++) {
for (int i = 0; i < n - 1; i++) {
if (d[i] > 0) {
d[i + 1] += d[i] / 2;
d[i] %= 2;
}
}
if (d[n - 1] > 0) {
d[0] += d[n - 1] / 2;
d[n - 1] %= 2;
}
}
for (int i = 0; i < n; i++) {
if (d[i]) {
cout << "No";
return;
}
}
cout << "Yes";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
input();
solve();
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... |