# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329852 | nickmet2004 | 송금 (JOI19_remittance) | C++11 | 677 ms | 36588 KiB |
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 int long long
using namespace std;
main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
vector<int> a(n) , b(n);
for(int i =0; i< n; ++i)cin >> a[i] >> b[i];
for(int k= 0; k< 60; ++k){
for(int i =0; i <n; ++i){
if(a[i] < b[i])continue;
if(a[i] <=1)continue;
a[(i + 1) % n] += (a[i] - b[i] + 1) / 2;
a[i] -= (a[i] - b[i] + 1) / 2 * 2;
if(a[i] < 0) a[i] += 2 , a[(i + 1) % n]--;
}
}
cout << ((a == b) ? "Yes" : "No") << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |