Submission #433844

#	Time	Username	Problem	Language	Result	Execution time	Memory
433844		dxz05	Remittance (JOI19_remittance)	C++14	0 / 100	1 ms	332 KiB

remittance

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 5e5 + 3e2;

#define MP make_pair
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int a[N], b[N];
void solve(){
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
    }

    while (true){
        bool ok = false;
        for (int i = 1; i <= n; i++){
            if (a[i] - b[i] >= 2){
                a[i] -= 2;
                a[i % n + 1]++;
                ok = true;
            }
        }

        if (!ok) break;
    }

    for (int i = 1; i <= n; i++){
        if (a[i] != b[i]){
            cout << "No";
            return;
        }
    }

    cout << "Yes";

}

int main(){
    ios_base::sync_with_stdio(false);
    //freopen("output.txt", "w", stdout);
    int tests = 1;
   // cin >> tests;

    while (tests--){
        solve();
    }

    return 0;
}

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