Submission #893668

#	Time	Username	Problem	Language	Result	Execution time	Memory
893668		Alcabel	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	604 KiB

remittance

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

void solve() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }
    long long denom = (1ll << n) - 1;
    vector<long long> x(n);
    for (int i = 0; i < n; ++i) {
        for (int j = i; j >= 0; --j) {
            x[i] = 2 * x[i] + b[j] - a[j];
        }
        for (int j = n - 1; j > i; --j) {
            x[i] = 2 * x[i] + b[j] - a[j];
        }
        x[i] = -x[i];
        if (x[i] < 0 || x[i] % denom != 0) {
            cout << "No\n";
            return;
        }
        x[i] /= denom;
    }
    for (int i = 0, prv = n - 1; i < n; ++i, ++prv) {
        if (prv == n) { prv = 0; }
        if (a[i] + x[prv] < 2 * x[i]) {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
        cerr << "-----------\n";
        cout << "-----------\n";
    }
#else
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#endif

    return 0;
}

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