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;
const int MAX_N = 1e6;
const long long INF = 1e17;
int a[MAX_N], b[MAX_N];
int main() {
    int n;
    cin >> n;
    for ( int i = 0; i < n; i++ )
        cin >> a[i] >> b[i];
    for ( int p = 0; p < 100; p++ ) {
        for ( int i = 0; i < n; i++ ) {
            if ( a[i] > b[i] ) {
                int x = (a[i] - b[i] + 1) / 2;
                if ( a[i] >= 2 * x ) {
                    a[(i + 1) % n] += x;
                    a[i] -= 2 * x;
                }
            }
        }
    }
    bool ans = true;
    for ( int i = 0; i < n; i++ )
        ans &= (a[i] == b[i]);
    cout << (ans ? "Yes" : "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... |