Submission #70445226

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

void solve() {
    int N;
    ll M;
    int C;
    cin >> N >> M >> C;
    vector<ll> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    ranges::sort(A);
    for (int i = 0; i < N; i++) {
        A.emplace_back(A[i] + M);
    }
    ll ans = 0, pre = -1;
    for (int i = 0, j = C; i <= N; i++) {
        chmax(j, i + C);
        while (j < int(A.size()) and A[j] == A[j - 1]) {
            j++;
        }
        ans += (min(A[i], M - 1) - pre) * (j - i);
        pre = A[i];
    }

    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}

Submission Info

Judge Result