#848787 (C++17) No.913 木の燃やし方

提出ソース

結果

問題	No.913 木の燃やし方
ユーザー	raven7959
提出日時	2023-03-13 14:51:08
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	13,674 bytes
コンパイル時間	2,744 ms
コンパイル使用メモリ	220,048 KB
実行使用メモリ	32,676 KB
最終ジャッジ日時	2024-09-18 07:33:18
合計ジャッジ時間	16,904 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	5 ms 6,940 KB
testcase_04	AC	7 ms 6,944 KB
testcase_05	AC	6 ms 6,944 KB
testcase_06	AC	4 ms 6,944 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	327 ms 28,960 KB
testcase_09	AC	320 ms 28,284 KB
testcase_10	AC	313 ms 28,160 KB
testcase_11	AC	322 ms 28,544 KB
testcase_12	AC	338 ms 29,628 KB
testcase_13	AC	324 ms 28,928 KB
testcase_14	AC	309 ms 28,196 KB
testcase_15	AC	312 ms 28,196 KB
testcase_16	AC	317 ms 29,056 KB
testcase_17	AC	300 ms 28,216 KB
testcase_18	AC	301 ms 28,160 KB
testcase_19	AC	330 ms 29,624 KB
testcase_20	AC	327 ms 29,696 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	313 ms 30,436 KB
testcase_25	AC	311 ms 29,712 KB
testcase_26	AC	328 ms 29,696 KB
testcase_27	AC	328 ms 29,568 KB
testcase_28	AC	347 ms 30,208 KB
testcase_29	AC	335 ms 30,224 KB
testcase_30	AC	336 ms 30,080 KB
testcase_31	AC	872 ms 31,544 KB
testcase_32	AC	342 ms 29,836 KB
testcase_33	AC	332 ms 29,616 KB
testcase_34	AC	325 ms 29,804 KB
testcase_35	AC	321 ms 29,676 KB
testcase_36	AC	312 ms 29,688 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define rrep(i, n) for (ll i = (int)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int,int>>;
using vpl = vector<pair<ll,ll>>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
template <class T> using priq = priority_queue<T>;
template <class T> using priqg = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1e9;
const ll LINF = 2e18;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }
template <typename T>
vi iota(int n) {
    vi a(n);
    return iota(a.begin(), a.end(), 0), a;
}
template <typename T> vi iota(const vector<T> &a, bool greater = false) {
    vi ret(a.size());
    iota(ret.begin(), ret.end(), 0);
    sort(ret.begin(), ret.end(), [&](int i, int j) {
        if(greater) return a[i] > a[j];
        return a[i] < a[j];
    });
    return ret;
}
template <typename S> void rearrange(const vector<S> &id) {}
template <typename S, typename T> void rearrange_exec(const vector<S> &id, vector<T> &v) {
    vector<T> w(v.size());
    rep(i, sz(id)) w[i] = v[id[i]];
    v.swap(w);
}
// 並び替える順番, 並び替えるvector
template <typename S, typename Head, typename... Tail> void rearrange(const vector<S> &id, Head &a, Tail &...tail) {
    rearrange_exec(id, a);
    rearrange(id, tail...);
}
template <typename T> vector<T> RUI(const vector<T> &v) {
    vector<T> res(v.size() + 1);
    for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];
    return res;
}
// 反時計周りに 90 度回転
template <typename T> void roth(vector<vector<T>> &v) {
    if(empty(v)) return;
    int n = v.size(), m = v[0].size();
    vector<vector<T>> res(m, vector<T>(n));
    rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];
    v.swap(res);
}
// 時計周りに 90 度回転
template <typename T> void rott(vector<vector<T>> &v) {
    if(empty(v)) return;
    int n = v.size(), m = v[0].size();
    vector<vector<T>> res(m, vector<T>(n));
    rep(i, n) rep(j, m) res[j][n - 1 - i] = v[i][j];
    v.swap(res);
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <typename T, typename S> T ceil(T x, S y) { // x/y以上の最小の整数を返す
    assert(y);
    return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
 
template <typename T, typename S> T floor(T x, S y) { // x/y以下の最大の整数を返す
    assert(y);
    return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
template <class S> vector<pair<S, int>> RunLength(const vector<S> &v) {
    vector<pair<S, int>> res;
    for(auto &e : v) {
        if(res.empty() || res.back().first != e)
            res.emplace_back(e, 1);
        else
            res.back().second++;
    }
    return res;
}
vector<pair<char, int>> RunLength(const string &v) {
    vector<pair<char, int>> res;
    for(auto &e : v) {
        if(res.empty() || res.back().first != e)
            res.emplace_back(e, 1);
        else
            res.back().second++;
    }
    return res;
}
template <class T, class F> T bin_search(T ok, T ng, const F &f) {
    while(abs(ok - ng) > 1) {
        T mid = ok + ng >> 1;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {
    while(iter--) {
        T mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
namespace aux {
template <typename T, unsigned N, unsigned L> struct tp {
    static void output(std::ostream &os, const T &v) {
        os << std::get<N>(v) << (&os == &cerr ? ", " : " ");
        tp<T, N + 1, L>::output(os, v);
    }
};
template <typename T, unsigned N> struct tp<T, N, N> {
    static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }
};
} // namespace aux
template <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {
    if(&os == &cerr) { os << '('; }
    aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);
    if(&os == &cerr) { os << ')'; }
    return os;
}
template <typename T> std::ostream &operator<<(std::ostream &os, const stack<T> &_st) {
    auto st = _st;
    vector<T> res;
    while(!empty(st)) res.emplace_back(st.top()), st.pop();
    reverse(all(res));
    return os << res;
}
template <typename T> std::ostream &operator<<(std::ostream &os, const queue<T> &_qu) {
    auto qu = _qu;
    vector<T> res;
    while(!empty(qu)) res.emplace_back(qu.front()), qu.pop();
    return os << res;
}
template <typename T> std::ostream &operator<<(std::ostream &os, const deque<T> &_dq) {
    auto dq = _dq;
    vector<T> res;
    while(!empty(dq)) res.emplace_back(dq.front()), dq.pop_front();
    return os << res;
}
template <typename T, typename S, typename U> std::ostream &operator<<(std::ostream &os, const priority_queue<T, S, U> &_pq) {
    auto pq = _pq;
    vector<T> res;
    while(!empty(pq)) res.emplace_back(pq.top()), pq.pop();
    return os << res;
}
template <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {
    if(&os == &cerr) { return os << "(" << p.first << ", " << p.second << ")"; }
    return os << p.first << " " << p.second;
}
template <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {
    bool f = true;
    if(&os == &cerr) os << "[";
    for(auto &y : x) {
        if(&os == &cerr)
            os << (f ? "" : ", ") << y;
        else
            os << (f ? "" : " ") << y;
        f = false;
    }
    if(&os == &cerr) os << "]";
    return os;
}

static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}

static double Rand01(){
    return (RandXor()+0.5)*(1.0/UINT_MAX);
}

template <typename T>
void rshuffle(vector<T> &V){
    random_device seed_gen;
    mt19937 engine(seed_gen());
    shuffle(V.begin(),V.end(),engine);
}

// auto seg=get_dual_segment_tree(N,h,OM0,commutative); のように宣言する
// N: 元配列の要素数
// h: 作用fと要素aに対して, f*f->f および f*a->a のはず
// OM0: 単位元
// commutative: 作用が可換かどうか, デフォルトはtrue
// update(l,r,x): 半開区間[l,r)にxを作用させる
// seg[k]でk番目の要素を取得できる

template <typename OperatorMonoid, typename H>
struct DualSegmentTree{

    DualSegmentTree(int n, const H h, const OperatorMonoid &OM0, bool commutative) : h(h), OM0(OM0), commutative(commutative){
        sz = 1;
        height = 0;
        while (sz < n) sz <<= 1, height++;
        lazy.assign(2 * sz, OM0);
    }

    void update(int a, int b, const OperatorMonoid &x){
        a+=sz;
        b+=sz-1;
        if(!commutative) thrust(a);
        if(!commutative) thrust(b);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1){
            if (l & 1) lazy[l] = h(lazy[l], x), ++l;
            if (r & 1) --r, lazy[r] = h(lazy[r], x);
        }
    }

    vector<OperatorMonoid> get_all(){
        for(int i=1;i<sz;i++) propagate(i);
        return vector<OperatorMonoid>(lazy.begin()+sz,lazy.end());
    }

    OperatorMonoid operator[](int k){
        if(commutative){
            OperatorMonoid ret=OM0;
            k+=sz;
            while(k){
                ret=h(ret,lazy[k]);
                k>>=1;
            }
            return ret;
        }
        else{
            thrust(k += sz);
            return lazy[k];
        }
    }

private:
    int sz, height;
    vector<OperatorMonoid> lazy;
    const H h;
    const OperatorMonoid OM0;
    bool commutative;

    inline void propagate(int k){
        if (lazy[k] != OM0){
            lazy[2 * k] = h(lazy[2 * k], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
            lazy[k] = OM0;
        }
    }

    inline void thrust(int k){
        for (int i = height; i > 0; i--) propagate(k >> i);
    }
};

template <typename OperatorMonoid, typename H>
DualSegmentTree<OperatorMonoid, H> get_dual_segment_tree(int N, const H &h, const OperatorMonoid &OM0,bool commutative=true){
    return {N, h, OM0, commutative};
}

// DynamicLiChaoTree<ll> LCT(ll min_index,ll max_index); などする
// xの動きうる最大範囲が[min_index,max_index)
// void add_line(T a,T b): 直線 ax+b を追加
// void add_segment_line(T Llim,T Rlim,T a,T b): [Llim,Rlim]の線分 ax+b を追加
// T get(T x): min(ax+b) を返す

template <typename T>
struct DynamicLiChaoTree{
private:
    struct Line{
        T slope, intercept;
        Line() : slope(0), intercept(numeric_limits<T>::max()) {}
        Line(T a, T b):slope(a),intercept(b) {}
        T f(T x) {return slope * x + intercept;}
    };

    struct node {
        Line line;
        node *left, *right;

        node(Line line):
            line(line),
            left(nullptr),
            right(nullptr) {}
    };

    const long long min_index,max_index;
    node* root;

    node* add_line(node* &t, long long l, long long r, Line line) const {
        if(l == r) return nullptr;
        if (!t) {
            t = new node(line);
            return t;
        }
        long long m = l+(r-l)>>1;
        bool L = (line.f(l) <= t->line.f(l));
        bool M = (line.f(m) <= t->line.f(m));
        bool R = (line.f(r) <= t->line.f(r));
        if(L && R){
            t->line = line;
            return t;
        }
        if(!L && !R){
            return t;
        }
        if(M){
            swap(t->line, line);
        }
        if(L != M){
            t->left=add_line(t->left, l, m, line);
        }
        else{
            t->right=add_line(t->right, m, r, line);
        }
        return t;
    }

    node* add_segment_line(node* &t, long long Llim, long long Rlim, long long l, long long r, Line line){
        if(r <= Llim || Rlim <= l) return t;
        if(Llim <= l && r <= Rlim) return add_line(t, l, r, line);
        if(t == nullptr) t = new node(Line());
        long long m = l+(r-l)>>1;
        t->left = add_segment_line(t->left, Llim, Rlim, l, m, line);
        t->right = add_segment_line(t->right, Llim, Rlim, m, r, line);
        return t;
    }

public:
    DynamicLiChaoTree(T min_index,T max_index):
        min_index(min_index),
        max_index(max_index),
        root(nullptr){}

    void add_line(T a, T b){
        Line line = Line{a, b};
        add_line(root, min_index, max_index, line);
    }

    void add_segment_line(T Llim, T Rlim, T a, T b){
        Line line = Line{a,b};
        add_segment_line(root, Llim, Rlim, min_index, max_index, line);
    }

    T get(long long x){
        node *t = root;
        long long l = min_index, r = max_index;
        T ret = numeric_limits<T>::max();
        while(r - l > 0 && t != nullptr){
            long long m = (l + r) >> 1;
            ret = min(ret, t->line.f(x));
            if(x < m){
                r = m;
                t = t->left;
            }
            else{
                l = m;
                t = t->right;
            }
        }
        return ret;
    }
};

void solve(){
    ll N;
    cin>>N;
    vl A(N);
    cin>>A;
    auto h=[&](ll l,ll r){
        return min(l,r);
    };
    auto seg=get_dual_segment_tree(N,h,LINF);
    auto calc=[&](auto &&self,ll l,ll r)->void{
        if(r-l<=0) return;
        if(r-l==1){
            seg.update(l,r,1+A[l]);
            return;
        }
        ll m=(l+r)/2;
        self(self,l,m);
        self(self,m,r);
        DynamicLiChaoTree<ll> DLC1(1,m-l+1);
        ll smy=0;
        for(ll i=m;i<r;i++){
            smy+=A[i];
            DLC1.add_line(2*(i-m+1),smy+(i-m+1)*(i-m+1));
        }
        ll smx=0;
        for(ll i=m-1;i>=l;i--){
            smx+=A[i];
            seg.update(i,m,DLC1.get(m-i)+(m-i)*(m-i)+smx);
        }
        DynamicLiChaoTree<ll> DLC2(1,r-m+1);
        smx=0;
        for(ll i=m-1;i>=l;i--){
            smx+=A[i];
            DLC2.add_line(2*(m-i),smx+(m-i)*(m-i));
        }
        smy=0;
        for(ll i=m;i<r;i++){
            smy+=A[i];
            seg.update(m,i+1,DLC2.get(i-m+1)+(i-m+1)*(i-m+1)+smy);
        }
    };
    calc(calc,0,N);
    auto ANS=seg.get_all();
    rep(i,N) cout<<ANS[i]<<"\n";
}

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

    solve();
}

yukicoder

結果

テストケース

ソースコード