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>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 1'000'010;
int a[N], b[N];
int n;
bool mv()
{
	bool change = 0;
	Loop (i,0,n) {
		int x = a[i] - b[i];
		if (b[i] == 0)
			x -= x&1;
		else
			x += x&1;
		if (x <= 0)
			continue;
		change = 1;
		a[i] -= x;
		a[i+1] += x/2;
	}
	a[0] += a[n];
	a[n] = 0;
	return change;
}
bool check()
{
	Loop (i,0,n)
		if (a[i] != b[i])
			return 0;
	return 1;
}
int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,0,n)
		cin >> a[i] >> b[i];
	while (mv());
	cout << (check()? "Yes": "No") << '\n';
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |