結果
問題 | No.913 木の燃やし方 |
ユーザー |
|
提出日時 | 2023-03-13 13:19:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 362 ms / 3,000 ms |
コード長 | 12,883 bytes |
コンパイル時間 | 2,492 ms |
コンパイル使用メモリ | 212,448 KB |
最終ジャッジ日時 | 2025-02-11 10:51:29 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#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);}// 並び替える順番, 並び替えるvectortemplate <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);elseres.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);elseres.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 auxtemplate <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;elseos << (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};}template<typename T> class CHT {private:struct node {node *left, *right;static const T inf = numeric_limits<T>::max();T a, b;node() : node(0, inf){}node(const T _a, const T _b): left(nullptr), right(nullptr), a(_a), b(_b){}T f(const T x) const { return a * x + b; }};static void swap(node *x, node *y){std::swap(x->a, y->a), std::swap(x->b, y->b);}void _add_line(node *cur, node *nw, T l, T r){while(true){if(nw->f(l) < cur->f(l)) swap(cur, nw);if(cur->f(r - 1) <= nw->f(r - 1)) break;const T mid = (l + r) / 2;if(cur->f(mid) <= nw->f(mid)){if(!cur->right){cur->right = new node(*nw);break;}else{cur = cur->right, l = mid;}}else{swap(cur, nw);if(!cur->left){cur->left = new node(*nw);break;}else{cur = cur->left, r = mid;}}}}T query(node *cur, const T k, T l, T r) const {T ans = numeric_limits<T>::max();while(cur){ans = min(ans, cur->f(k));const T mid = (l + r) / 2;if(k < mid){cur = cur->left, r = mid;}else{cur = cur->right, l = mid;}}return ans;}void clear(node *cur){if(cur->left) clear(cur->left);if(cur->right) clear(cur->right);delete cur;}const T lpos, rpos;node *root;public:CHT(const T _lpos, const T _rpos) : lpos(_lpos), rpos(_rpos), root(new node()){assert(lpos < rpos);}// ~CHT(){ clear(root); }// f(x) = a * x + b を挿入void add_line(const T a, const T b){node nw(a, b);return _add_line(root, &nw, lpos, rpos);}// x = k での最小値T query(const T k) const {return query(root, k, lpos, rpos);}};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);CHT<ll> cht1(1,m-l+1);ll smy=0;for(ll i=m;i<r;i++){smy+=A[i];cht1.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,cht1.query(m-i)+(m-i)*(m-i)+smx);}CHT<ll> cht2(1,r-m+1);smx=0;for(ll i=m-1;i>=l;i--){smx+=A[i];cht2.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,cht2.query(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();}