제출 #397738

#제출 시각아이디문제언어결과실행 시간메모리
397738timmyfengRemittance (JOI19_remittance)C++17
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 1000000;

int a[N], b[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

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

    while (true) {
        bool delta = false;

        for (int i = 0; i < n; ++i) {
            int send = max(0, (a[i] - b[i]) / 2);
            delta |= send > 0;
            a[(i + 1) % n] += send;
            a[i] -= 2 * send;
        }

        if (!delta) {
            break;
        }
    }

    cout << (equal(a, a + n, b) ? "Yes" : "No") << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...