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;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }
    if (*max_element(b.begin(), b.end()) == 0 && *max_element(a.begin(), a.end()) > 0) {
        cout << "No\n";
        return 0;
    }
    for (int _ = 0; _ < 30; ++_) {
        for (int i = 0; i < n; ++i) {
            if (a[i] > b[i]) {
                int x = (a[i] - b[i] + 1) / 2;
                a[(i + 1) % n] += x;
                a[i] -= 2 * x;
            }
        }
    }
    if (a == b) {
        cout << "Yes";
    } else {
        cout << "No";
    }
    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... |