Submission #62988170

---

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, k;
    is >> n >> k;

    std::map<Num,Num> counts;
    for(Num i{0}; i<n; ++i) {
        Num a;
        is >> a;
        a %= k;
        counts[a] += 1;
        counts[a + k] += 1;
    }

    if (counts.size() <= 2) {
        os << "0\n";
        return;
    }

    std::vector<std::pair<Num,Num>> ls;
    for(const auto& [v, cnt] : counts) {
        ls.push_back(std::make_pair(cnt, v));
    }
    std::ranges::sort(ls);

    const auto max_count = ls.back().first;
    Set ssmax;
    for(const auto& [cnt, v] : ls) {
        if (cnt == max_count) {
            ssmax.insert(v);
            ssmax.insert(v + k);
        }
    }

    Num dist {0};
    Num current = *ssmax.begin();
    for(const auto& v : ssmax) {
        if (v >= k) {
            break;
        }

        auto it = ssmax.lower_bound(v);
        ++it;
        const auto u = *it;
        const auto d = u - v;

        if ((d > dist) && (d < k)) {
            dist = d;
            current = u % k;
        }
    }

    Num ans {0};
    for(Num i{1}; i<n; ++i) {
        const auto v = current % k;
        auto it = counts.find(v);
        ++it;
        const auto u = it->first;

        counts[v] -= 1;
        counts[v + k] -= 1;
        if (counts[v] == 0) {
            counts.erase(v);
            counts.erase(v + k);
        }

        const auto d = (u + k - v) % k;
        ans += (k - d) % k;
        current = u % k;
    }

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

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

Submission Info

Judge Result