Submission #60559177

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

void solve(std::istream& is, std::ostream& os) {
    Num n, a, b, c, d;
    is >> n >> a >> b >> c >> d;
    --n;
    const auto n2 = n / 2;

    if (a > b) {
        std::swap(a,b);
    }
    b -= a;
    const auto w = d - c;

    if (n == 1) {
        if ((c <= b) && (b <= d)) {
            os << "YES\n";
        } else {
            os << "NO\n";
        }
        return;
    }


    std::vector<std::pair<Num,Num>> rs;
    Num odd = n % 2;
    if (((c * 2) <= d) && (b <= (d * n))) {
        os << "YES\n";
        return;
    }

    for(Num i{1}; i<=n2; ++i) {
        const auto p = i * 2 + odd;
        const auto m = n2 - i;
        const auto l = c * p - m * w;
        const auto r = d * p + m * w;
        rs.push_back(std::make_pair(l, r));
    }

    std::ranges::sort(rs);
    for(const auto& [l,r] : rs) {
        if ((l <= b) && (b <= r)) {
            os << "YES\n";
            return;
        }
    }

    os << "NO\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result