結果
問題 | No.484 収穫 |
ユーザー | koyumeishi |
提出日時 | 2017-02-11 01:22:58 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 87 ms / 3,000 ms |
コード長 | 4,628 bytes |
コンパイル時間 | 1,118 ms |
コンパイル使用メモリ | 107,672 KB |
実行使用メモリ | 34,688 KB |
最終ジャッジ日時 | 2024-10-13 13:10:05 |
合計ジャッジ時間 | 2,956 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 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 | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 86 ms
34,688 KB |
testcase_13 | AC | 86 ms
34,688 KB |
testcase_14 | AC | 86 ms
34,560 KB |
testcase_15 | AC | 86 ms
34,688 KB |
testcase_16 | AC | 86 ms
34,560 KB |
testcase_17 | AC | 86 ms
34,560 KB |
testcase_18 | AC | 85 ms
34,688 KB |
testcase_19 | AC | 86 ms
34,688 KB |
testcase_20 | AC | 86 ms
34,688 KB |
testcase_21 | AC | 84 ms
34,688 KB |
testcase_22 | AC | 86 ms
34,560 KB |
testcase_23 | AC | 87 ms
34,688 KB |
ソースコード
#include <iostream> #include <vector> #include <cstdio> #include <sstream> #include <map> #include <string> #include <algorithm> #include <queue> #include <cmath> #include <functional> #include <set> #include <ctime> #include <random> #include <chrono> #include <cassert> #include <tuple> #include <utility> using namespace std; namespace { using Integer = long long; //__int128; template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;} template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;} template<class T> istream& operator , (istream& is, T& val){ return is >> val;} template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;} template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;} template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template<class H> void print(const H& head){ cout << head; } template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template<class ... T> void println(const T& ... values){ print(values...); cout << endl; } template<class H> void eprint(const H& head){ cerr << head; } template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()); template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; int main(){ int n; cin >> n; vector<long long> a(n); cin >> a; if(n == 1){ println(a[0]); return 0; } vector<vector<long long>> dp(n, vector<long long>(n, 1ll<<50 )); dp[n-1][0] = a[0]; dp[0][n-1] = a[n-1]; for(int d=n-1; d>=1; d--){ for(int l=0; l<n; l++){ int r = l+d; if(r>=n) break; {// l [l+1, r] int pos = l; int ll = l+1; int rr = r; // pos -> ll long long t = dp[r][l] + abs(ll-pos); if(t < a[ll]){ t = a[ll]; } dp[rr][ll] = min(dp[rr][ll], t); // pos -> rr t = dp[r][l] + abs(rr-pos); if(t < a[rr]){ t = a[rr]; } dp[ll][rr] = min(dp[ll][rr], t); } {// [l, r-1] r int pos = r; int ll = l; int rr = r-1; // pos -> ll long long t = dp[l][r] + abs(ll-pos); if(t < a[ll]){ t = a[ll]; } dp[rr][ll] = min(dp[rr][ll], t); // pos -> rr t = dp[l][r] + abs(rr-pos); if(t < a[rr]){ t = a[rr]; } dp[ll][rr] = min(dp[ll][rr], t); } } } long long ans = 1ll<<50; for(auto i : range(n) ){ ans = min(ans, dp[i][i]); } println(ans); return 0; }