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 all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll INF=(1LL<<40);
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;cin>>n;
	vector<ll> a(n),b(n);
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i];
	}
	bool f=true;
	while(1){
		for(int i=0;i<n;i++){
			if(a[i]<b[i]){
				f=false;
				break;
			}
			ll c=(a[i]-b[i]+1LL)/2LL;
			a[i]-=2LL*c;
			a[(i+1)%n]+=c;
		}
		if(!f){
			break;
		}
		bool f2=true;
		for(int i=0;i<n;i++){
			if(a[i]!=b[i]){
				f2=false;
			}
		}
		if(f2){
			break;
		}
	}
	if(f){
		cout<<"Yes"<<endl;
	}else{
		cout<<"No"<<endl;
	}
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |