# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609888 | penguinhacker | Remittance (JOI19_remittance) | C++17 | 1 ms | 212 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 ar array
const int mxN=1e6;
int n;
ll a[mxN], b[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i)
cin >> a[i] >> b[i];
for (int i=0, change=0; change<3*n; i=i+1<n?i+1:0) {
if (a[i]>b[i]&&a[i]>=2) {
int x=(a[i]-b[i]+1)/2;
a[i+1<n?i+1:0]+=x;
a[i]-=2*x;
change=0;
} else
++change;
}
/*while(1) {
vector<int> v;
for (int i=0; i<n; ++i)
if (a[i]>b[i]) {
assert(a[i]==b[i]+1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |