結果

問題 No.3303 Heal Slimes 2
コンテスト
ユーザー AngrySadEight
提出日時 2025-10-07 01:46:34
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,203 bytes
コンパイル時間 3,859 ms
コンパイル使用メモリ 195,812 KB
実行使用メモリ 16,088 KB
最終ジャッジ日時 2025-10-07 01:46:56
合計ジャッジ時間 19,171 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b){
    return a + b;
}

ll e(){
    return 0LL;
}

int main(){
    ll N, K, D;
    cin >> N >> K >> D;

    vector<ll> H(N);
    for (ll i = 0; i < N; i++){
        cin >> H[i];
    }

    map<ll, ll> mp;
    vector<ll> rev;
    for (ll i = 0; i < N; i++){
        mp[H[i]]++;
    }
    ll now = 0;
    for (auto it = mp.begin(); it != mp.end(); it++){
        it->second = now;
        now++;
        rev.push_back(it->first);
    }

    segtree<ll, op, e> seg1(now);
    segtree<ll, op, e> seg2(now);

    for (ll i = 0; i < K; i++){
        seg1.set(mp[H[i]], seg1.get(mp[H[i]]) + 1);
        seg2.set(mp[H[i]], seg2.get(mp[H[i]]) + H[i]);
    }
    ll INF = 100000000000000023;
    ll ans = INF;
    for (ll i = K - 1; i < N; i++){
        if (i > K - 1){
            seg1.set(mp[H[i - K]], seg1.get(mp[H[i - K]]) - 1);
            seg2.set(mp[H[i - K]], seg2.get(mp[H[i - K]]) - H[i - K]);
            seg1.set(mp[H[i]], seg1.get(mp[H[i]]) + 1);
            seg2.set(mp[H[i]], seg2.get(mp[H[i]]) + H[i]);
        }
        // どこに合わせるべきかを調整
        ll left = rev[0] - D - 1;
        ll right = rev.back() + 1;

        while (right - left > 1){
            ll mid = (left + right) / 2;

            ll l_bord = lower_bound(all(rev), mid) - rev.begin();
            ll r_bord = lower_bound(all(rev), mid + D + 1) - rev.begin();

            ll l_seg = 0, r_seg = 0;
            if (l_bord > 0){
                l_seg = seg1.prod(0, l_bord);
            }
            if (r_bord < now){
                r_seg = seg1.prod(r_bord, now);
            }
            if (l_seg <= r_seg){
                left = mid;
            }
            else{
                right = mid;
            }
        }
        ll l_bord = lower_bound(all(rev), left) - rev.begin();
        ll r_bord = lower_bound(all(rev), left + D + 1) - rev.begin();

        ll anssub = 0;

        ll l_seg = 0, r_seg = 0;
        if (l_bord > 0){
            l_seg = seg1.prod(0, l_bord);
            // debug(l_seg);
            anssub += (l_seg * left - seg2.prod(0, l_bord));
        }
        if (r_bord < now){
            r_seg = seg1.prod(r_bord, now);
            // debug(r_seg);
            anssub += (seg2.prod(r_bord, now) - r_seg * (left + D));
        }
        ans = min(ans, anssub);
    }
    cout << ans << endl;
}
0