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 ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
ll a[n+1],b[n+1];
for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
for(int j=0;j<30;j++){
for(int i=1;i<=n;i++){
if(a[i]<=b[i])continue;
ll rs = (a[i]-b[i])/2;
a[i]-=2*rs;
if(i!=n)a[i+1]+=rs;
else a[1]+=rs;
}
}bool ok=1;
for(int i=1;i<=n;i++){
if(a[i]!=b[i])ok=0;
}
cout<<(ok?"Yes":"No");
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |