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 <iostream>
using namespace std;
int main()
{
long long n;
cin >> n;
long long A[n], B[n];
long long s, sv = -4000000000000000000;
for(long long i = 0; i < n; i++)
{
cin >> A[i] >> B[i];
if(A[i] - B[i] > sv)
{
sv = A[i] - B[i];
s = i;
}
}
if(sv < 0)
{
cout << "No\n";
return 0;
}
for(long long t = 1; t <= 40; t++)
{
if(A[s] - B[s] > 1)
{
A[(s+1) % n] += (A[s] - B[s]) / 2;
A[s] -= 2*((A[s] - B[s]) / 2);
}
for(long long i = (s+1)%n; i != s; i = (i+1)%n)
{
if(A[i] - B[i] <= 0) continue;
A[(i+1)%n] += (A[i] - B[i]) / 2;
A[i] -= 2*((A[i] - B[i]) / 2);
}
}
for(long long i = 0; i < n; i++)
{
if(A[i] == B[i]) continue;
cout << "No\n";
return 0;
}
cout << "Yes\n";
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... |