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>
#pragma GCC optimize ("Ofast")
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
int a[n], b[n];
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
for(int k = 0; k < 10; k++){
for(int i = 0; i < n; i++){
if(a[i] > b[i]){
int delta = min(a[i] / 2, (a[i] - b[i] + 1) / 2);
a[i] -= 2 * delta;
a[(i + 1) % n] += delta;
}
}
}
for(int i = 0; i < n; i++){
if(a[i] != b[i]){
cout << "NO";
return 0;
}
}
cout << "YES";
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... |