Submission #51847204

---

Source Code Expand

/**
 *  @the_hyp0cr1t3
 *  30.03.2024 17:33
**/
#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    i64 n, a, b;
    std::cin >> n >> a >> b;
    std::vector<i64> d(n);
    for (auto &x : d) {
        std::cin >> x;
        x %= (a + b);
    }

    std::ranges::sort(d);
    d.erase(std::unique(d.begin(), d.end()), d.end());
    n = d.size();

    for (int i = 0; i < n; i++) {
        i64 y = (d[(i - 1 + n) % n] - d[i] + (a + b)) % (a + b);
        if (y < a) {
            std::cout << "Yes" << '\n';
            return 0;
        }
    }

    std::cout << "No" << '\n';
}

Submission Info

Judge Result