Submission #56585353

---

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';
        }
    }
}

Num n, d;
constexpr Num Inf = 1000000000000000LL;

Vec dist(const Vec& xs, Num center) {
    const auto init = center - d;
    Num s {0};
    for(const auto& x : xs) {
        s += std::abs(x - init);
    }

    Vec result(d*2+1);
    result.at(0) = s;
    for(Num i{1}; i<=d*2; ++i) {
        const Num cnt = std::ranges::lower_bound(xs, init + i) - xs.begin();
        s += cnt - (n - cnt);
        result.at(i) = s;
    }

    return result;
}

void solve(std::istream& is, std::ostream& os) {
    is >> n >> d;

    Vec xs(n);
    Vec ys(n);
    Num max_x {Inf};
    Num max_y {Inf};
    for(Num i{0}; i<n; ++i) {
        is >> xs.at(i) >> ys.at(i);
        max_x = std::min(max_x, xs.at(i));
        max_y = std::min(max_y, ys.at(i));
    }
    std::ranges::sort(xs);
    std::ranges::sort(ys);

    auto dxs = dist(xs, max_x);
    std::ranges::sort(dxs);

    auto dys = dist(ys, max_y);
    std::ranges::sort(dys);

    Num ans {0};
    for(const auto& s : dxs) {
        if (d < s) {
            continue;
        }
        const auto w = d - s;
        const Num cnt = std::ranges::upper_bound(dys, w) - dys.begin();
        ans += cnt;
    }

    os << ans << "\n";
}

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

Submission Info

Judge Result