結果

問題 No.913 木の燃やし方
ユーザー yosupot
提出日時 2019-10-18 22:32:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,870 ms / 3,000 ms
コード長 5,916 bytes
コンパイル時間 2,498 ms
コンパイル使用メモリ 206,184 KB
最終ジャッジ日時 2025-01-07 23:15:48
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#ifdef LOCAL
struct PrettyOS {
    ostream& os;
    bool first;
    template <class T> auto operator<<(T&& x) {
        if (!first) os << ", ";
        first = false;
        os << x;
        return *this;
    }
};
template <class... T> void dbg0(T&&... t) {
    (PrettyOS{cerr, true} << ... << t);
}
#define dbg(...)                                            \
    do {                                                    \
        cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \
        dbg0(__VA_ARGS__);                                  \
        cerr << endl;                                       \
    } while (false);
#else
#define dbg(...)
#endif
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "P(" << p.first << ", " << p.second << ")";
}
template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
    os << "[";
    for (auto d : v) os << d << ", ";
    return os << "]";
}
template <class D, class L, class OpDD, class OpDL, class OpLL> struct SegTree {
    D e_d;
    L e_l;
    OpDD op_dd;
    OpDL op_dl;
    OpLL op_ll;
    int sz, lg;  //(2^lgに拡張後の)サイズ, lg
    V<D> d;
    V<L> lz;
    SegTree(const V<D>& v,
            D _e_d,
            L _e_l,
            OpDD _op_dd,
            OpDL _op_dl,
            OpLL _op_ll)
        : e_d(_e_d), e_l(_e_l), op_dd(_op_dd), op_dl(_op_dl), op_ll(_op_ll) {
        int n = int(v.size());
        lg = 1;
        while ((1 << lg) < n) lg++;
        sz = 1 << lg;
        d = V<D>(2 * sz, e_d);
        lz = V<L>(2 * sz, e_l);
        for (int i = 0; i < n; i++) d[sz + i] = v[i];
        for (int i = sz - 1; i >= 0; i--) {
            update(i);
        }
    }
    void all_add(int k, L x) {
        d[k] = op_dl(d[k], x);
        lz[k] = op_ll(lz[k], x);
    }
    void push(int k) {
        all_add(2 * k, lz[k]);
        all_add(2 * k + 1, lz[k]);
        lz[k] = e_l;
    }
    void update(int k) { d[k] = op_dd(d[2 * k], d[2 * k + 1]); }
    void set(int p, D x) {
        p += sz;
        for (int i = lg; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= lg; i++) update(p >> i);
    }
    void add(int a, int b, L x, int l, int r, int k) {
        if (b <= l || r <= a) return;
        if (a <= l && r <= b) {
            all_add(k, x);
            return;
        }
        push(k);
        int mid = (l + r) / 2;
        add(a, b, x, l, mid, 2 * k);
        add(a, b, x, mid, r, 2 * k + 1);
        update(k);
    }
    void add(int a, int b, L x) { add(a, b, x, 0, sz, 1); }
    D single(int p) {
        p += sz;
        for (int i = lg; i >= 1; i--) push(p >> i);
        return d[p];
    }
    D sum(int a, int b, int l, int r, int k) {
        if (b <= l || r <= a) return e_d;
        if (a <= l && r <= b) return d[k];
        push(k);
        int mid = (l + r) / 2;
        return op_dd(sum(a, b, l, mid, 2 * k), sum(a, b, mid, r, 2 * k + 1));
    }
    D sum(int a, int b) { return sum(a, b, 0, sz, 1); }
};
template <class D, class L, class OpDD, class OpDL, class OpLL>
SegTree<D, L, OpDD, OpDL, OpLL> get_seg(V<D> v,
                                        D e_d,
                                        L e_l,
                                        OpDD op_dd,
                                        OpDL op_dl,
                                        OpLL op_ll) {
    return SegTree<D, L, OpDD, OpDL, OpLL>(v, e_d, e_l, op_dd, op_dl, op_ll);
}
struct Solver {
    int n, f;
    V<ll> a, as;
    template<class Seg>
    void solve(int pl, int pu, int lw, int up, Seg& seg) {
        if (pl > pu) return;
        int p = (pl + pu) / 2;
        int ar = -1; ll mi = TEN(18);
        for (int i = max(p, lw); i <= up; i++) {
            ll sc = as[i + 1] - as[p];
            sc += ll(i - p + 1) * (i - p + 1);
            if (sc <= mi) {
                mi = sc;
                ar = i;
            }
        }
        seg.add(p, ar + 1, mi);
        solve(pl, p - 1, lw, ar, seg);
        solve(p + 1, pu, ar, up, seg);
    }
    template<class Seg>
    void solve2(int l, int r, Seg& seg) {
        if (l == r) {
            seg.add(l, l + 1, a[l] + 1);
            return;
        }
        int md = (l + r) / 2;
        if ((l + r) % 2 == 0) md -= f;
        solve2(l, md, seg);
        solve2(md + 1, r, seg);
        solve(l, md, md + 1, r, seg);        
    }
    
    V<ll> exec(V<ll> _a, int _f) {
        a = _a;
        f = _f;
        n = int(a.size());
        as = V<ll>(n + 1);
        for (int i = 0; i < n; i++) {
            as[i + 1] = as[i] + a[i];
        }
        auto seg = get_seg(V<ll>(n, TEN(18)), TEN(18), TEN(18),
            [&](ll x, ll y) { return min(x, y); },
            [&](ll x, ll y) { return min(x, y); },
            [&](ll x, ll y) { return min(x, y); }
            );
        //solve(0, n - 1, 0, n - 1, seg);
        solve2(0, n - 1, seg);
        auto ans = V<ll>(n);
        for (int i = 0; i < n; i++) {
            ans[i] = seg.single(i);
        }
        return ans;
    }
};
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int n;
    cin >> n;
    V<ll> a = V<ll>(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    auto ans0 = Solver().exec(a, 0);
    reverse(a.begin(), a.end());
    auto ans1 = Solver().exec(a, 1);
    reverse(ans1.begin(), ans1.end());
    for (int i = 0; i < n; i++) {
        cout << min(ans0[i], ans1[i]) << "\n";
    }
//    for (ll d: ans0) {
//        cout << d << "\n";
//    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0