結果

問題 No.1174 盆栽の剪定
ユーザー 👑 tatyamtatyam
提出日時 2020-08-15 17:02:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 6,438 bytes
コンパイル時間 2,350 ms
コンパイル使用メモリ 204,720 KB
実行使用メモリ 158,080 KB
最終ジャッジ日時 2024-04-19 01:31:53
合計ジャッジ時間 9,566 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 123 ms
157,824 KB
testcase_01 AC 123 ms
157,952 KB
testcase_02 AC 123 ms
157,952 KB
testcase_03 AC 123 ms
158,080 KB
testcase_04 AC 121 ms
157,952 KB
testcase_05 AC 122 ms
158,080 KB
testcase_06 AC 121 ms
157,952 KB
testcase_07 AC 130 ms
157,952 KB
testcase_08 AC 125 ms
157,824 KB
testcase_09 AC 132 ms
157,952 KB
testcase_10 AC 123 ms
157,824 KB
testcase_11 AC 125 ms
157,824 KB
testcase_12 AC 123 ms
157,952 KB
testcase_13 AC 123 ms
157,824 KB
testcase_14 AC 122 ms
157,952 KB
testcase_15 AC 123 ms
157,824 KB
testcase_16 AC 126 ms
158,080 KB
testcase_17 AC 125 ms
158,080 KB
testcase_18 AC 122 ms
157,952 KB
testcase_19 AC 227 ms
157,824 KB
testcase_20 AC 221 ms
157,824 KB
testcase_21 AC 134 ms
158,080 KB
testcase_22 AC 229 ms
157,952 KB
testcase_23 AC 231 ms
158,080 KB
testcase_24 AC 222 ms
158,080 KB
testcase_25 AC 184 ms
157,952 KB
testcase_26 AC 202 ms
158,080 KB
testcase_27 AC 182 ms
157,952 KB
testcase_28 AC 217 ms
157,952 KB
testcase_29 AC 178 ms
157,824 KB
testcase_30 AC 226 ms
158,080 KB
testcase_31 AC 175 ms
157,952 KB
testcase_32 AC 181 ms
158,080 KB
testcase_33 AC 194 ms
157,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ull=unsigned long long;
using uint=unsigned int;
using pcc=pair<char,char>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using tuplis=pair<ll,pll>;
using tuplis2=pair<pll,ll>;
template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
const int INF=0x3fffffff;
const double DINF=numeric_limits<double>::infinity();
const vector<pii> four={{-1,0},{0,1},{1,0},{0,-1}};
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) for(ll i=0;i<n;++i)
#define _rep2(i,n) for(ll i=0;i<n;++i)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) for(ll i=n-1;i>=0;i--)
#define _rrep2(i,n) for(ll i=n-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)
#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
#define each(i,a) for(auto& i:a)
#define sum(...) accumulate(range(__VA_ARGS__),0LL)
#define dsum(...) accumulate(range(__VA_ARGS__),double(0))
#define _range(i) (i).begin(),(i).end()
#define _range2(i,k) (i).begin(),(i).begin()+k
#define _range3(i,a,b) (i).begin()+a,(i).begin()+b
#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(),(i).rend()
#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k
#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)
#define yes(i) out(i?"yes":"no")
#define Yes(i) out(i?"Yes":"No")
#define YES(i) out(i?"YES":"NO")
#define Possible(i) out(i?"Possible":"Impossible")
#define elif else if
#define unless(a) if(!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};
inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;if(a<b){ll c=a;a=b;b=c;}while(b){ll c=b;b=a%b;a=c;}return a;}
inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}
template<class T>inline constexpr T min(vector<T>& v){return *min_element(range(v));}
inline char min(string& v){return *min_element(range(v));}
template<class T>inline constexpr T max(vector<T>& v){return *max_element(range(v));}
inline char max(string& v){return *max_element(range(v));}
inline constexpr ll intpow(ll a,ll b){if(b==0)return 1;ll ans=intpow(a,b/2);return ans*ans*(b&1?a:1);}
inline constexpr ll modpow(ll a,ll b,ll mod=MOD){if(b==0)return 1;ll ans=modpow(a,b/2);return ans*ans*(b&1?a:1)%mod;}
template<typename T>
inline constexpr bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}
template<typename T>
inline constexpr bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}
inline void in() {}
template<class T>
istream& operator >> (istream& is, vector<T>& vec);
template<class T,size_t size>
istream& operator >> (istream& is, array<T,size>& vec);
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p);
template<class T>
ostream& operator << (ostream& os, vector<T>& vec);
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p);
template<class T>
istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}
template<class T>
ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}
template<class T>
ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}
template<class T,class L>
pair<T,L> operator + (pair<T,L> a, pair<T,L> b){return {a.first + b.first, a.second + b.second};}
template <class Head, class... Tail>
inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}
template <class T>
inline bool out(T t){cout<<t<<endl;return 0;}
inline bool out(){cout<<'\n';return 0;}
template <class Head, class... Tail>
inline bool out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);return 0;}
template <class T>
inline void err(T t){cerr<<t<<'\n';}
inline void err(){cerr<<'\n';}
template <class Head, class... Tail>
inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}




ll n=100001;
vec(ll,a,n);
vv(tuplis,mem,n,64,{-LINF,{0,0}});
inline tuplis make_tuplis(ll value,ll weight,ll keisuu){
    return {value+weight*keisuu,{value,weight}};
}
tuplis dp(ll at,ll keisuu){
    if(at>n)return {0,{0,0}};
    ll id=keisuu+32;
    if(mem[at][id]!=mp(-LINF,mp(0ll,0ll)))return mem[at][id];
    mem[at][id]={0,{0,0}};
    pll b=dp(at*2,keisuu+1).second,c=dp(at*2+1,keisuu-1).second;
    if(b.second>=c.second)update_max(mem[at][id],make_tuplis(b.first+c.first+b.second-c.second,a[at]+b.second+c.second,keisuu));
    if(b.second>0)update_max(mem[at][id],make_tuplis(b.first+b.second,a[at]+b.second,keisuu));
    b=dp(at*2+1,keisuu+1).second;c=dp(at*2,keisuu-1).second;
    if(b.second>=c.second)update_max(mem[at][id],make_tuplis(b.first+c.first+b.second-c.second,a[at]+b.second+c.second,keisuu));
    if(b.second>0)update_max(mem[at][id],make_tuplis(b.first+b.second,a[at]+b.second,keisuu));
    return mem[at][id];
}
signed main(){
    in(n);
    rep(i,1,n+1)in(a[i]);
    out(dp(1,0).second.first);
}
0