Submission #972489

#TimeUsernameProblemLanguageResultExecution timeMemory
97248912345678Remittance (JOI19_remittance)C++17
0 / 100
1 ms2512 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;

int n, a[nx], b[nx], lst, cnt;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];
    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;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...