結果

問題 No.3303 Heal Slimes 2
ユーザー だれ
提出日時 2025-10-07 02:34:30
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,136 bytes
コンパイル時間 3,824 ms
コンパイル使用メモリ 237,132 KB
実行使用メモリ 14,500 KB
最終ジャッジ日時 2025-10-07 02:34:46
合計ジャッジ時間 14,143 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 16 WA * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(x)                      \
    std::sort((x).begin(), (x).end()); \
    (x).erase(std::unique((x).begin(), (x).end()), (x).end())
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
using i32 = int;
using ld = long double;
using f64 = double;
template <class T, class U>
bool chmin(T& a, const U& b) {
    return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
    return (b > a) ? (a = b, true) : false;
}
template <class T = std::string, class U = std::string>
inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") {
    if (f)
        std::cout << yes << "\n";
    else
        std::cout << no << "\n";
}
namespace io {

template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
    i >> p.first >> p.second;
    return i;
}

template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
    o << p.first << " " << p.second;
    return o;
}

template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
    rep(j, v.size()) i >> v[j];
    return i;
}
template <typename T>
string join(vector<T>& v) {
    stringstream s;
    rep(i, v.size()) s << ' ' << v[i];
    return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
    if (v.size()) o << join(v);
    return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
    string s = "\n";
    rep(i, vv.size()) s += join(vv[i]) + "\n";
    return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
    if (vv.size()) o << join(vv);
    return o;
}

void OUT() { std::cout << "\n"; }

template <class Head, class... Tail>
void OUT(Head&& head, Tail&&... tail) {
    std::cout << head;
    if (sizeof...(tail)) std::cout << ' ';
    OUT(std::forward<Tail>(tail)...);
}

void OUTL() { std::cout << std::endl; }

template <class Head, class... Tail>
void OUTL(Head&& head, Tail&&... tail) {
    std::cout << head;
    if (sizeof...(tail)) std::cout << ' ';
    OUTL(std::forward<Tail>(tail)...);
}

void IN() {}

template <class Head, class... Tail>
void IN(Head&& head, Tail&&... tail) {
    cin >> head;
    IN(std::forward<Tail>(tail)...);
}

}  // namespace io
using namespace io;

namespace useful {
long long modpow(long long a, long long b, long long mod) {
    long long res = 1;
    while (b) {
        if (b & 1) res *= a, res %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }

template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
    vector<T> b = a;
    for (int i = 0; i < int(a.size()); i++) {
        a[i] = b[p[i]];
    }
    return;
}

template <std::forward_iterator I>
std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>>
run_length_encoding(I s, I t) {
    if (s == t) return {};
    std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>>
        res;
    res.emplace_back(*s, 1);
    for (auto it = ++s; it != t; it++) {
        if (*it == res.back().first)
            res.back().second++;
        else
            res.emplace_back(*it, 1);
    }
    return res;
}

vector<int> linear_sieve(int n) {
    vector<int> primes;
    vector<int> res(n + 1);
    iota(all(res), 0);
    for (int i = 2; i <= n; i++) {
        if (res[i] == i) primes.emplace_back(i);
        for (auto j : primes) {
            if (j * i > n) break;
            res[j * i] = j;
        }
    }
    return res;
    // return primes;
}

template <class T>
vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {
    int n = graph.size();
    vector<long long> res(n, 2e18);
    res[start] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>,
                   greater<pair<long long, int>>>
        que;
    que.push({0, start});
    while (!que.empty()) {
        auto [c, v] = que.top();
        que.pop();
        if (res[v] < c) continue;
        for (auto [nxt, cost] : graph[v]) {
            auto x = c + cost;
            if (x < res[nxt]) {
                res[nxt] = x;
                que.push({x, nxt});
            }
        }
    }
    return res;
}

}  // namespace useful
using namespace useful;

template <class T, T l, T r>
struct RandomIntGenerator {
    std::random_device seed;
    std::mt19937_64 engine;
    std::uniform_int_distribution<T> uid;

    RandomIntGenerator() {
        engine = std::mt19937_64(seed());
        uid = std::uniform_int_distribution<T>(l, r);
    }

    T gen() { return uid(engine); }
};

using P = pair<i64, i64>;

P op(P a, P b) {
    chmin(a.first, b.first);
    chmax(a.second, b.second);
    return a;
}

P e() { return make_pair(1e18, -1e18); }

int main() {
    std::cout << fixed << setprecision(15);
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k;
    i64 d;
    IN(n, k, d);
    vector<i64> h(n);
    IN(h);
    vector<P> tmp(n);
    rep(i, n) tmp[i] = {h[i], h[i]};
    atcoder::segtree<P, op, e> seg(tmp);
    auto z = h;
    rep(i, n) z.emplace_back(h[i] + d);
    UNIQUE(z);
    auto idx = [&](i64 x) -> int { return lower_bound(all(z), x) - z.begin(); };
    int N = z.size();
    atcoder::fenwick_tree<i64> fw(N + 1), cnt(N + 1);
    rep(i, k - 1) {
        fw.add(idx(h[i]), h[i]);
        cnt.add(idx(h[i]), 1);
    }
    i64 ans = 1e18;
    rep(l, n - k + 1) {
        int r = l + k;
        auto [p, q] = seg.prod(l, r);
        fw.add(idx(h[r - 1]), h[r - 1]);
        cnt.add(idx(h[r - 1]), 1);
        i64 lw = p, hi = q + 1;
        int ip = idx(p), iq = idx(q + 1);
        while (hi - lw > 1) {
            i64 mid = (hi + lw) / 2;
            int r1 = idx(mid), l1 = idx(mid + d + 1);
            r1 = clamp(r1, ip, iq);
            l1 = clamp(l1, ip, iq);
            int cc = cnt.sum(ip, r1);
            int dd = cnt.sum(l1, iq);
            if (cc <= dd)
                lw = mid;
            else
                hi = mid;
        }
        swap(hi, lw);
        i64 x = 0;
        int r1 = idx(lw), l1 = idx(lw + d);
        r1 = clamp(r1, ip, iq);
        l1 = clamp(l1, ip, iq);
        x += cnt.sum(ip, r1) * lw;
        x -= fw.sum(ip, r1);
        x += fw.sum(l1, iq);
        x -= cnt.sum(l1, iq) * (lw + d);
        chmin(ans, x);
        fw.add(idx(h[l]), -h[l]);
        cnt.add(idx(h[l]), -1);
    }
    OUT(ans);
}
0