Submission #660877

#	Time	Username	Problem	Language	Result	Execution time	Memory
660877		Kahou	Remittance (JOI19_remittance)	C++14	100 / 100	335 ms	16852 KiB

remittance

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e6 + 50;
int n, a[N], b[N];

void solve() {
        cin >> n;
        for (int i = 1; i <= n; i++) {
                cin >> a[i] >> b[i];
        }
        for (int t = 1; t <= 35; t++) {
                for (int i = 1; i <= n; i++) {
                        if (a[i] <= b[i]) continue;
                        int tmp = (a[i]-b[i]);
                        if (tmp&1) {
                                tmp += (b[i]? 1: -1);
                        }
                        a[i] -= tmp;
                        a[i%n+1] += (tmp>>1);
                }
        }
        bool flg = 1;
        for (int i = 1; i <= n; i++) {
                flg = flg&&(a[i] == b[i]);
        }
        cout << (flg? "Yes":"No") << endl;
}
int main() {
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        solve();
        return 0;
}

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