結果
問題 | No.484 収穫 |
ユーザー | shimomire |
提出日時 | 2017-02-11 00:55:11 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 123 ms / 3,000 ms |
コード長 | 5,278 bytes |
コンパイル時間 | 1,197 ms |
コンパイル使用メモリ | 133,212 KB |
実行使用メモリ | 97,408 KB |
最終ジャッジ日時 | 2024-10-13 13:09:46 |
合計ジャッジ時間 | 3,385 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 3 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 119 ms
97,408 KB |
testcase_13 | AC | 120 ms
97,408 KB |
testcase_14 | AC | 123 ms
97,408 KB |
testcase_15 | AC | 123 ms
97,408 KB |
testcase_16 | AC | 121 ms
97,408 KB |
testcase_17 | AC | 123 ms
97,408 KB |
testcase_18 | AC | 122 ms
97,280 KB |
testcase_19 | AC | 122 ms
97,408 KB |
testcase_20 | AC | 123 ms
97,408 KB |
testcase_21 | AC | 122 ms
97,408 KB |
testcase_22 | AC | 123 ms
97,408 KB |
testcase_23 | AC | 121 ms
97,408 KB |
ソースコード
#include <cassert>// c #include <iostream>// io #include <iomanip> #include <fstream> #include <sstream> #include <vector>// container #include <map> #include <unordered_map> #include <set> #include <queue> #include <bitset> #include <stack> #include <algorithm>// other #include <complex> #include <numeric> #include <functional> #include <random> #include <regex> using namespace std; typedef long long ll;typedef unsigned long long ull;typedef long double ld; #define ALL(c) c.begin(),c.end() #define IN(l,v,r) (l<=v && v < r) template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());} //debug== #define DUMP(x) cerr << #x <<" = " << (x) #define LINE() cerr<< " (L" << __LINE__ << ")" struct range{ struct Iter{ int v,step; Iter& operator++(){v+=step;return *this;} bool operator!=(Iter& itr){return v<itr.v;} int& operator*(){return v;} }; Iter i, n; range(int i, int n,int step):i({i,step}), n({n,step}){} range(int i, int n):range(i,n,1){} range(int n):range(0,n){} Iter& begin(){return i;} Iter& end(){return n;} }; struct rrange{ struct Iter{ int v,step; Iter& operator++(){v-=step;return *this;} bool operator!=(Iter& itr){return v>itr.v;} int& operator*(){return v;} }; Iter i, n; rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){} rrange(int i, int n):rrange(i,n,1){} rrange(int n) :rrange(0,n){} Iter& begin(){return n;} Iter& end(){return i;} }; //input template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;} template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);} template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);} template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);} template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);} template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;} //output template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;} template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;} template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;} template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);} template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);} template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);} template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);} template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;} template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;} // values template<typename T> inline T INF(){assert(false);}; template<> inline int INF<int>(){return 1<<28;}; template<> inline ll INF<ll>(){return 1LL<<60;}; template<> inline double INF<double>(){return 1e16;}; template<> inline long double INF<long double>(){return 1e16;}; template<class T> inline T EPS(){assert(false);}; template<> inline int EPS<int>(){return 1;}; template<> inline ll EPS<ll>(){return 1LL;}; template<> inline double EPS<double>(){return 1e-12;}; template<> inline long double EPS<long double>(){return 1e-12;}; // min{2^r | n < 2^r} template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;} // max{d | 2^d <= n} template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;} class Main{ public: int N; vector<ll> as; vector<vector<vector<ll>>> dp; ll dfs(int x,int l,int r){ if(dp[x][l][r] != INF<ll>()) return dp[x][l][r]; if(x == 0){ if(l-1 >= 0){ dp[x][l][r] = min(dp[x][l][r],max(dfs(x,l-1,r),as[l-1])+1); } if(r+1 <= N){ dp[x][l][r] = min(dp[x][l][r],max(dfs(1-x,l,r+1),as[r])+(r-l)); } }else{ if(l-1 >= 0){ dp[x][l][r] = min(dp[x][l][r],max(dfs(1-x,l-1,r),as[l-1])+(r-l)); } if(r+1 <= N){ dp[x][l][r] = min(dp[x][l][r],max(dfs(x,l,r+1),as[r])+1); } } return dp[x][l][r]; } void run(){ cin >> N; as = vector<ll>(N);cin >> as; dp =vector<vector<vector<ll>>>(2,vector<vector<ll>>(N,vector<ll>(N+1,INF<ll>()))); dp[0][0][N] = 0; dp[1][0][N] = 0; ll res = INF<ll>(); for(int x:range(2))for(int l:range(N)){ res = min(res,max(dfs(x,l,l+1),as[l])); } cout << res << endl; } }; int main(){ cout <<fixed<<setprecision(20); cin.tie(0); ios::sync_with_stdio(false); Main().run(); return 0; }