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 F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll N=1e6+5;
ll a[N],b[N],n;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n;
for (int i=0;i<n;i++) cin>>a[i]>>b[i];
int x;
do{
x=0;
for (int i=0;i<n;i++){
if (a[i]-b[i]>1){
a[(i+1)%n]+=(a[i]-b[i])/2;
a[i]=b[i]+a[i]%2;
x++;
}
}
}while(x);
bool ok=true;
for (int i=0;i<n;i++){
if (a[i]<b[i]){
ok=0;
break;
}
}
if (ok) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
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... |