Submission #147496

#	Time	Username	Problem	Language	Result	Execution time	Memory
147496		dolphingarlic	Remittance (JOI19_remittance)	C++14	0 / 100	2 ms	380 KiB

remittance

#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;

int a[1000000], b[1000000];

int main() {
    iostream::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    FOR(i, 0, n) cin >> a[i] >> b[i];

    bool possible = true;
    do {
        possible = false;
        FOR(i, 0, n) {
            if (a[i] - b[i] > 1) {
                a[(i + 1) % n] += (a[i] - b[i]) / 2;
                a[i] -= (a[i] - b[i]) / 2 * 2;
            }
        }
        FOR(i, 0, n) possible |= (a[i] - b[i] > 1);
    } while (possible);

    bool ans = true;
    FOR(i, 0, n) ans &= (a[i] == b[i]);

    if (ans) cout << "Yes";
    else cout << "No";
    return 0;
}

Compilation message (stderr)

remittance.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")

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