結果
問題 | No.913 木の燃やし方 |
ユーザー |
|
提出日時 | 2019-10-23 01:28:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 322 ms / 3,000 ms |
コード長 | 5,234 bytes |
コンパイル時間 | 2,001 ms |
コンパイル使用メモリ | 178,484 KB |
実行使用メモリ | 15,920 KB |
最終ジャッジ日時 | 2024-07-05 06:02:43 |
合計ジャッジ時間 | 15,316 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#include <bits/stdc++.h>#define whlie while#define pb push_back#define eb emplace_back#define fi first#define se second#define rep(i,N) for(int i = 0; i < (N); i++)#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)#define rep1(i,N) for(int i = 1; i <= (N) ; i++)#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)#define each(x,v) for(auto& x : v)#define all(v) (v).begin(),(v).end()#define sz(v) ((int)(v).size())#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)using namespace std; void solve();using ll = long long; using vl = vector<ll>;using vi = vector<int>; using vvi = vector< vector<int> >;constexpr int inf = 1001001001;constexpr ll infLL = (1LL << 61) - 1;struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os;}template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}template<typename T>void die(T x){out(x); exit(0);}#ifdef NyaanDebug#include "NyaanDebug.h"#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)#define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)#else#define trc(...)#define trca(...)int main(){solve();}#endifusing P = pair<int,int>; using vp = vector<P>;constexpr int MOD = /** 1000000007; //*/ 998244353;////////////////template<typename T>struct LiChaoTree{struct Line{T slope , intercept;Line(T slope,T intercept) : slope(slope),intercept(intercept){}inline T get(T x) const{return slope * x + intercept;}inline bool over(const Line& other , const T &x) const{return get(x) < other.get(x);}};// remind セグ木は0-indexedの実装vector<T> xset;vector<Line> seg;int _size;// 引数xにはソート済みのx座標の集合を入れるLiChaoTree(const vector<T> &x, T INF) : xset(x) {_size = 1; while(_size < (int)xset.size()) _size <<= 1;while( (int)xset.size() < _size) xset.push_back(xset.back() + 1);seg.assign(2 * _size - 1, Line(0, INF));}// y = ax + bなる直線を追加void update(T a, T b){Line x(a , b);// x.over(xset[right])とするとout of boundになることに留意するint left = 0 , right = _size , seg_idx = 0;while(1){int mid = (left + right) >> 1;bool l_over = x.over(seg[seg_idx], xset[left]);bool r_over = x.over(seg[seg_idx], xset[mid]);if(r_over) swap(seg[seg_idx], x);if(left + 1 >= right) return;else if(l_over != r_over) seg_idx = 2 * seg_idx + 1 , right = mid;else seg_idx = 2 * seg_idx + 2 , left = mid;}}// x = xset[k]なる点における最小値クエリT query(int k) {const T x = xset[k];k += _size - 1;T ret = seg[k].get(x);while(k > 0) {k = (k - 1) >> 1;ret = min(ret, seg[k].get(x) );}return ret;}};int N; vl a , s;vl dp;void divideconquer(int L,int R){if(L == R) return;if(L + 1 == R){ amin(dp[L] , 1 + a[L]); return; }int M = (L + R) >> 1;// L <= i < M のとき{vl xs(M - L); rep(i , M - L) xs[i] = i + L;LiChaoTree<ll> lichao(xs , infLL);for(ll l = M+1; l <= R; l++) lichao.update(l * (-2) , l*l + s[l]);ll y[M - L];for(ll k = L; k < M; k++) y[k-L] = lichao.query(k-L) + k*k - s[k];rep1(i , M - L - 1) amin(y[i] , y[i-1]);for(ll k = L; k < M; k++) amin(dp[k] , y[k-L]);}// M <= i < Rのとき{vl xs(R - M); rep(i , R - M) xs[i] = i + M + 1;LiChaoTree<ll> lichao(xs , infLL);for(ll k = L; k <= M; k++) lichao.update(k * (-2) , k*k - s[k]);ll y[R - M];for(ll l = M + 1; l <= R; l++) y[l-M-1] = lichao.query(l-M-1)+l*l+s[l];repr1(i , R - M - 1) amin(y[i-1] , y[i]);for(int l = M; l < R; l++) amin(dp[l] , y[l-M]);}divideconquer(L , M);divideconquer(M + 1 , R);}void solve(){in(N);a.resize(N); in(a);dp.resize(N , infLL);s.resize(N + 1 , 0);rep1(i , N) s[i] = s[i - 1] + a[i - 1];divideconquer(0 , N);each(x , dp) out(x);}