結果

問題 No.3303 Heal Slimes 2
ユーザー dyktr_06
提出日時 2025-07-09 05:47:00
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,134 ms / 4,000 ms
コード長 5,981 bytes
コンパイル時間 2,047 ms
コンパイル使用メモリ 208,192 KB
実行使用メモリ 13,440 KB
最終ジャッジ日時 2025-10-06 12:42:20
合計ジャッジ時間 21,347 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;

template <typename S, typename T, T (*op)(T, T), T(*e)()>
struct DynamicSegTree{
    DynamicSegTree(S n) : n(n), root(nullptr) {}
private:
    struct node;
    using node_ptr = std::unique_ptr<node>;

    struct node{
        S index;
        T value, product;
        node_ptr left, right;

        node(S index, T value)
            : index(index),
                value(value),
                product(value),
                left(nullptr),
                right(nullptr) {}

        void refresh() {
            product = op(op(left ? left->product : e(), value), right ? right->product : e());
        }
    };

    const S n;
    node_ptr root;

    void update(node_ptr& t, S a, S b, S i, T x) const {
        if(!t){
            t = std::make_unique<node>(i, x);
            return;
        }
        if(t->index == i){
            t->value = x;
            t->refresh();
            return;
        }
        S c = (a + b) >> 1;
        if(i < c){
            if(t->index < i) std::swap(t->index, i), std::swap(t->value, x);
            update(t->left, a, c, i, x);
        } else {
            if(i < t->index) std::swap(i, t->index), std::swap(x, t->value);
            update(t->right, c, b, i, x);
        }
        t->refresh();
    }

    T get(const node_ptr& t, S a, S b, S i) const {
        if(!t) return e();
        if(t->index == i) return t->value;
        S c = (a + b) >> 1;
        if(i < c) return get(t->left, a, c, i);
        else return get(t->right, c, b, i);
    }

    T query(const node_ptr& t, S a, S b, S l, S r) const {
        if(!t || b <= l || r <= a) return e();
        if(l <= a && b <= r) return t->product;
        S c = (a + b) >> 1;
        T result = query(t->left, a, c, l, r);
        if(l <= t->index && t->index < r) result = op(result, t->value);
        return op(result, query(t->right, c, b, l, r));
    }

    void reset(node_ptr& t, S a, S b, S l, S r) const {
        if(!t || b <= l || r <= a) return;
        if(l <= a && b <= r){
            t.reset();
            return;
        }
        S c = (a + b) >> 1;
        reset(t->left, a, c, l, r);
        reset(t->right, c, b, l, r);
        t->refresh();
    }

    template <class F>
    S max_right(const node_ptr& t, S a, S b, S l, const F& f, T& product) const {
        if(!t || b <= l) return n;
        if(f(op(product, t->product))){
            product = op(product, t->product);
            return n;
        }
        S c = (a + b) >> 1;
        S result = max_right(t->left, a, c, l, f, product);
        if(result != n) return result;
        if(l <= t->index) {
            product = op(product, t->value);
            if(!f(product)) return t->index;
        }
        return max_right(t->right, c, b, l, f, product);
    }

    template <class F>
    S min_left(const node_ptr& t, S a, S b, S r, const F& f, T& product) const {
        if(!t || r <= a) return 0;
        if(f(op(t->product, product))){
            product = op(t->product, product);
            return 0;
        }
        S c = (a + b) >> 1;
        S result = min_left(t->right, c, b, r, f, product);
        if(result != 0) return result;
        if(t->index < r){
            product = op(t->value, product);
            if(!f(product)) return t->index + 1;
        }
        return min_left(t->left, a, c, r, f, product);
    }

public:
    void update(S i, T x) {
        assert(i < n);
        update(root, 0, n, i, x);
    }

    T get(S i) const {
        assert(i < n);
        return get(root, 0, n, i);
    }

    T query(S l, S r) const {
        assert(l <= r && r <= n);
        return query(root, 0, n, l, r);
    }

    T all_query() const {
        return root ? root->product : e();
    }

    void reset(S l, S r) {
        assert(l <= r && r <= n);
        return reset(root, 0, n, l, r);
    }

    template <bool (*f)(T)>
    S max_right(S l) const {
        return max_right(l, [](T x) { return f(x); });
    }

    template <class F>
    S max_right(S l, const F& f) const {
        assert(l <= n);
        T product = e();
        assert(f(product));
        return max_right(root, 0, n, l, f, product);
    }

    template <bool (*f)(T)>
    S min_left(S r) const {
        return min_left(r, [](T x) { return f(x); });
    }

    template <class F>
    S min_left(S r, const F& f) const {
        assert(r <= n);
        T product = e();
        assert(f(product));
        return min_left(root, 0, n, r, f, product);
    }
};

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

long long e(){
    return 0LL;
}

const long long INF = 1LL << 60;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    long long d; cin >> d;
    vector<long long> h(n);
    for(int i = 0; i < n; i++){
        cin >> h[i];
    }

    long long maxval = 1e9, siz = 3e9;
    DynamicSegTree<long long, long long, op, e> cnt(siz), val(siz);
    for(int i = 0; i < k - 1; i++){
        cnt.update(h[i], cnt.get(h[i]) + 1);
        val.update(h[i], val.get(h[i]) + h[i]);
    }

    long long ans = INF;

    auto f = [&](long long x){
        long long res = 0;
        res += cnt.query(0, x + 1) * x - val.query(0, x + 1);
        res += val.query(x + d, siz) - cnt.query(x + d, siz) * (x + d);
        return res;
    };

    for(int i = k - 1; i < n; i++){
        cnt.update(h[i], cnt.get(h[i]) + 1);
        val.update(h[i], val.get(h[i]) + h[i]);

        int ok = 0, ng = maxval + 1;
        while(abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            if(cnt.query(mid + d, siz) - cnt.query(0, mid + 1) >= 0){
                ok = mid;
            } else {
                ng = mid;
            }
        }
        ans = min(ans, f(ok));
        ans = min(ans, f(ok + 1));

        cnt.update(h[i - k + 1], cnt.get(h[i - k + 1]) - 1);
        val.update(h[i - k + 1], val.get(h[i - k + 1]) - h[i - k + 1]);
    }
    cout << ans << endl;
    return 0;
}
0