結果
問題 | No.952 危険な火薬庫 |
ユーザー | ningenMe |
提出日時 | 2019-12-15 03:12:07 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 8,482 bytes |
コンパイル時間 | 3,886 ms |
コンパイル使用メモリ | 178,972 KB |
実行使用メモリ | 398,208 KB |
最終ジャッジ日時 | 2023-09-10 21:10:03 |
合計ジャッジ時間 | 5,667 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
8,756 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | TLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define REP(i,n) for(long long i = 0; i < (n); i++) #define FOR(i, m, n) for(long long i = (m);i < (n); ++i) #define ALL(obj) (obj).begin(),(obj).end() #define SPEED cin.tie(0);ios::sync_with_stdio(false); template<class T> using V = vector<T>; template<class T, class U> using P = pair<T, U>; template<class T> using PQ = priority_queue<T>; template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = (long long)1e9 + 7; constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> void chmax(T& a, const T b){a=max(a,b);} template <class T> void chmin(T& a, const T b){a=min(a,b);} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} template<class typeNode, class typeLazy, class Operator> class LazySegmentTree { size_t length; //セグメント木の最下段の要素の数(vectorの要素の数を超える2べきの数) size_t height; //セグメント木の高さ typeNode unitNode; //nodeの単位元 typeLazy unitLazy; //lazyの単位元 vector<typeNode> node; //node vector<typeLazy> lazy; //lazy vector<int> width; //width Operator Op; public: //同じinitで初期化 LazySegmentTree(const size_t num, const typeNode unitNode, const typeLazy unitLazy, const typeNode init) : unitNode(unitNode), unitLazy(unitLazy) { for (length = 1,height = 0; length < num; length *= 2, height++); node.resize(2 * length, unitNode); lazy.resize(2 * length, unitLazy); for (int i = 0; i < num; ++i) node[i + length] = init; for (int i = length - 1; i >= 0; --i) node[i] = Op.funcNode(node[(i<<1)+0],node[(i<<1)+1]); width.resize(2 * length, 0); for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k; } //unitで初期化 LazySegmentTree(const size_t num, const typeNode unitNode, const typeLazy unitLazy) : unitNode(unitNode), unitLazy(unitLazy) { for (length = 1,height = 0; length < num; length *= 2, height++); node.resize(2 * length, unitNode); lazy.resize(2 * length, unitLazy); for (int i = 0; i < num; ++i) node[i + length] = unitNode; for (int i = length - 1; i >= 0; --i) node[i] = Op.funcNode(node[(i<<1)+0],node[(i<<1)+1]); width.resize(2 * length, 0); for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k; } //vectorで初期化 LazySegmentTree(const vector<typeNode>& vec, const typeNode unitNode, const typeLazy unitLazy) : unitNode(unitNode), unitLazy(unitLazy) { for (length = 1,height = 0; length < vec.size(); length *= 2, height++); node.resize(2 * length, unitNode); lazy.resize(2 * length, unitLazy); for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i]; for (int i = length - 1; i >= 0; --i) node[i] = Op.funcNode(node[(i<<1)+0],node[(i<<1)+1]); width.resize(2 * length, 0); for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k; } void propagate(int k) { if(lazy[k] == unitLazy) return; node[k] = Op.funcMerge(node[k],lazy[k],width[k]); if(k < length) lazy[2*k+0] = Op.funcLazy(lazy[2*k+0],lazy[k]); if(k < length) lazy[2*k+1] = Op.funcLazy(lazy[2*k+1],lazy[k]); lazy[k] = unitLazy; } //idx : 0-indexed void update(int a, int b, typeLazy x) { int l = a + length, r = b + length - 1; for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i); for(r++; l < r; l >>=1, r >>=1) { if(l&1) lazy[l] = Op.funcLazy(lazy[l],x), propagate(l),l++; if(r&1) --r,lazy[r] = Op.funcLazy(lazy[r],x), propagate(r); } l = a + length, r = b + length - 1; while ((l>>=1),(r>>=1),l) { if(lazy[l] == unitLazy) node[l] = Op.funcNode(Op.funcMerge(node[(l<<1)+0],lazy[(l<<1)+0],width[(l<<1)+0]),Op.funcMerge(node[(l<<1)+1],lazy[(l<<1)+1],width[(l<<1)+1])); if(lazy[r] == unitLazy) node[r] = Op.funcNode(Op.funcMerge(node[(r<<1)+0],lazy[(r<<1)+0],width[(r<<1)+0]),Op.funcMerge(node[(r<<1)+1],lazy[(r<<1)+1],width[(r<<1)+1])); } } //[l,r) typeNode get(int a, int b) { int l = a + length, r = b + length - 1; for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i); typeNode vl = unitNode, vr = unitNode; for(r++; l < r; l >>=1, r >>=1) { if(l&1) vl = Op.funcNode(vl,Op.funcMerge(node[l],lazy[l],width[l])),l++; if(r&1) r--,vr = Op.funcNode(Op.funcMerge(node[r],lazy[r],width[r]),vr); } return Op.funcNode(vl,vr); } void print(){ // cout << "node" << endl; // for(int i = 1,j = 1; i < 2*length; ++i) { // cout << node[i] << " "; // if(i==((1<<j)-1) && ++j) cout << endl; // } // cout << "lazy" << endl; // for(int i = 1,j = 1; i < 2*length; ++i) { // cout << lazy[i] << " "; // if(i==((1<<j)-1) && ++j) cout << endl; // } // cout << "width" << endl; // for(int i = 1,j = 1; i < 2*length; ++i) { // cout << width[i] << " "; // if(i==((1<<j)-1) && ++j) cout << endl; // } // cout << "vector" << endl; cout << "{ " << get(0,1); for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1); cout << " }" << endl; } }; //node:最小 lazy:加算 template<class typeNode, class typeLazy> struct nodeMinLazyAdd { typeNode funcNode(typeNode l,typeNode r){ return min(l,r); } typeLazy funcLazy(typeLazy l,typeLazy r){ return l+r; } typeNode funcMerge(typeNode l,typeLazy r,int len){ return l+r; } //example }; int main() { SPEED int N; cin >> N; vector<ll> A(N+2,0); for(int i = 1; i <= N; ++i) cin >> A[i]; vector<LazySegmentTree<ll,ll,nodeMinLazyAdd<ll,ll>>> dp(N+2,LazySegmentTree<ll,ll,nodeMinLazyAdd<ll,ll>>(N+2,LOWINF,0,0)); dp[0].update(1,N+2,LOWINF); for(int i = 1; i <= N+1; ++i){ vector<ll> B(N+2,0); for(int j = 0; i+j <= N+1; ++j){ ll x = dp[i-1].get(0,j+1); dp[i].update(j,j+1,x); for(int k = 0; k <= N+1; ++k) dp[i-1].update(k,k+1,-B[k]*B[k]); for(int k = 0; k <= j; ++k) B[k] += A[i+j]; for(int k = 0; k <= N+1; ++k) dp[i-1].update(k,k+1,B[k]*B[k]); } } vector<ll> ans(N+2,0); for(int i = 1; i <= N; ++i){ ans[i] = dp[N+1-i].get(i,i+1); cout << ans[i] << endl; } }