# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296433 | BeanZ | Remittance (JOI19_remittance) | C++14 | 1 ms | 384 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>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
ll a[N], b[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("balance.in", "r")){
freopen("balance.in", "r", stdin);
freopen("balance.out", "w", stdout);
}
ll n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
while (true){
bool flag = false;
for (int i = 1; i < n; i++){
if (a[i] <= b[i]) continue;
ll rem = a[i] - b[i];
ll pass = rem / 2;
if (pass == 0) continue;
flag = true;
a[i + 1] += pass;
a[i] -= pass * 2;
}
if (a[n] > (b[n] + 1)){
ll rem = a[n] - b[n];
ll pass = rem / 2;
flag = true;
a[1] += pass;
a[n] -= pass * 2;
}
if (!flag) break;
}
for (int i = 1; i <= n; i++){
if (a[i] != b[i]) return cout << "No", 0;
}
cout << "Yes";
}
/*
*/
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... |