Submission #677879

#	Time	Username	Problem	Language	Result	Execution time	Memory
677879		puppy	Remittance (JOI19_remittance)	C++17	55 / 100	717 ms	32768 KiB

remittance

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n;
int a[1000005];
int b[1000005];
int x[1000005];
signed main()
{
    cin >> n;
    int tot = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        tot += (1LL << i) * (a[i] - b[i]);
    }
    if (tot % ((1 << n) - 1)) {
        cout << "No\n";
        return 0;
    }
    else x[0] = tot / ((1 << n) - 1);
    for (int i = 0; i < n - 1; i++) {
        int p = x[i] + a[i] - b[i];
        if (p % 2) {
            cout << "No\n";
            return 0;
        }
        else x[i+1] = p / 2;
    }
    bool ok = true;
    for (int i = 0; i < n; i++) ok &= (x[i] >= 0);
    bool ok2 = false;
    for (int i = 0; i < n; i++) ok2 |= (b[i] != 0);
    if (!ok2) {
        ok2 = true;
        for (int i = 0; i < n; i++) ok2 &= (a[i] == 0);
        cout << (ok2 ? "Yes" : "No") << '\n';
    }
    else cout << (ok ? "Yes" : "No") << '\n';
}

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