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 nx=1e6+5;
#define ll long long
int n, a[nx], b[nx], lst, cnt;
ll sm, bsm;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=0; i<n; i++) cin>>a[i]>>b[i], sm+=a[i], bsm+=b[i];
if (bsm==0) return cout<<(sm==0?"Yes":"No"), 0;
while (1)
{
for (int i=0; i<n; i++)
{
lst++;
if (a[i]>b[i]+1) a[(i+1)%n]+=(a[i]-b[i])/2, a[i]-=((a[i]-b[i])/2)*2, lst=0;
if (lst==n)
{
for (int j=0; j<n; j++)
{
if (a[j]!=b[j])
{
for (int k=0; k<n; k++) if (b[k]>=a[k]) return cout<<"No", 0;
return cout<<"Yes", 0;
}
}
return cout<<"Yes", 0;
}
}
}
}
/*
5
0 0
0 0
0 0
0 1
16 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... |