제출 #336384

#제출 시각아이디문제언어결과실행 시간메모리
336384KoD송금 (JOI19_remittance)C++17
55 / 100
859 ms51492 KiB
#include <bits/stdc++.h>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

template <class T>
using Vec = std::vector<T>;

constexpr i32 inf32 = (u32) ~0 >> 2;
constexpr i64 inf64 = (u64) ~0 >> 2;

int main() {
    usize N;
    std::cin >> N;
    Vec<i64> A(N), B(N);
    for (usize i = 0; i < N; ++i) {
        std::cin >> A[i] >> B[i];
    }
    assert(N <= 20);
    Vec<i64> dif(N);
    for (usize i = 0; i < N; ++i) {
        const auto j = (i + 1 == N ? 0 : i + 1);
        dif[i] = B[j] - A[j];
    }
    for (usize i = 0; i + 1 < N; ++i) {
        dif[N - 1] += dif[i] * (1 << (i + 1));
    }
    if (dif[N - 1] > 0 || dif[N - 1] % ((1 << N) - 1) != 0) {
        std::cout << "No\n";
        return 0;
    }
    Vec<i64> X(N);
    X[N - 1] = -(dif[N - 1] / ((1 << N) - 1));
    for (usize i = N - 1; i --> 0;) {
        X[i] = dif[i] + 2 * X[i + 1];
        if (X[i] < 0) {
            std::cout << "No\n";
            return 0;
        }
    }
    for (usize step = 0; step < 60; ++step) {
        for (usize i = 0; i < N; ++i) {
            const auto j = (i + 1 == N ? 0 : i + 1);
            const auto tmp = std::min(X[i], A[i] / 2);
            X[i] -= tmp;
            A[i] -= 2 * tmp;
            A[j] += tmp;
        }
    }
    for (usize i = 0; i < N; ++i) {
        if (A[i] != B[i]) {
            std::cout << "No\n";
            return 0;
        }
    }
    std::cout << "Yes\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...