Submission #747590

#TimeUsernameProblemLanguageResultExecution timeMemory
747590stevancv송금 (JOI19_remittance)C++14
0 / 100
1 ms328 KiB
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 1e9;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
    for (int zz = 0; zz < 50; zz++) {
        for (int i = 0; i < n; i++) {
            if (a[i] > b[i]) {
                int c = (a[i] - b[i]) / 2;
                a[(i + 1) % n] += c;
                a[i] -= 2 * c;
            }
        }
    }
    array<int, 2> cnt = {0, 0};
    for (int i = 0; i < n; i++) if (0 <= a[i] - b[i] && a[i] - b[i] <= 1) cnt[a[i] - b[i]] += 1;
    if (cnt[0] == n || cnt[1] == n) cout << "Yes" << en;
    else cout << "No" << en;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...