Submission #552091

#	Time	Username	Problem	Language	Result	Execution time	Memory
552091		RaresFelix	Remittance (JOI19_remittance)	C++17	100 / 100	259 ms	16592 KiB

remittance

#include <bits/stdc++.h>
#define MN 1000071
#pragma GCC optimize("O3")
using ll = long long;
using namespace std;
ll n, A[MN], B[MN];
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> A[i] >> B[i];
    int ok;
    do {
        ok = 0;
        for(int i = 1; i <= n; ++i) {
            if(A[i] > B[i]) {
                ll v;
                ok = 1, v = (A[i] - B[i] + 1) >> 1;
                if(A[i] < (v << 1)) --v;
                if(!v) ok = 0;
                A[i + 1] += v;
                A[i] -= v << 1;
            }
        }
        A[1] += A[n + 1];
        A[n + 1] = 0;
    } while(ok);
    ok = 1;
    for(int i = 1; i <= n; ++i) if(A[i] != B[i]) ok = 0;
    cout << (ok ? "Yes\n" : "No\n");
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 45 / 45