Submission #168832

#	Time	Username	Problem	Language	Result	Execution time	Memory
168832		popovicirobert	Remittance (JOI19_remittance)	C++14	100 / 100	333 ms	28756 KiB

remittance

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define uint unsigned int



#if 0
const int MOD = (int);

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;



int main() {
#ifdef HOME
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

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

    bool flag = 1;
    while(flag) {
        flag = 0;

        int sum = 0;
        for(i = 0; i < n; i++) {
            a[i] += sum;
            if(a[i] - b[i] > 0) {
                sum = min(a[i] / 2, (a[i] - b[i]) / 2 + (a[i] - b[i]) % 2);
                flag |= (sum > 0);
            }
            else {
                sum = 0;
            }
            a[i] -= 2 * sum;
        }
        a[0] += sum;

        /*for(i = 0; i < n; i++) {
            cerr << a[i] << " ";
        }
        cerr << "\n";*/
    }

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

    cout << "Yes";

    return 0;
}

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