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 ss second
#define ff first
using namespace std;
const int N = 222222;
int n;
ll a[N], b[N], k;
int main()
{
cin >> n;
for (int i=1; i<=n; i++) cin >> a[i] >> b[i];
int q = 1000;
while (q)
{
for (int i=1; i<n; i++)
{
if (a[i] > b[i])
{
k = a[i] - b[i];
a[i+1] += k / 2 + k % 2;
a[i] = b[i] - k % 2;
}
}
if (a[n] > b[n])
{
k = a[n] - b[n];
a[1] += k / 2 + k % 2;
a[n] = b[n] - k % 2;
}
q--;
}
for (int i=1; i<=n; i++)
{
if (a[i] != b[i])
{
cout << "No";
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... |