結果
問題 |
No.595 登山
|
ユーザー |
|
提出日時 | 2018-12-01 23:35:10 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 29 ms / 1,500 ms |
コード長 | 2,626 bytes |
コンパイル時間 | 1,297 ms |
コンパイル使用メモリ | 162,968 KB |
実行使用メモリ | 7,936 KB |
最終ジャッジ日時 | 2024-06-27 01:38:46 |
合計ジャッジ時間 | 2,915 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
#include "bits/stdc++.h" #define ALL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define RREP(i, x, n) for(int i = x; i >= n; i--) #define rrep(i, n) RREP(i,n,0) #define pb push_back #pragma GCC optimize ("-O3") using namespace std; #define DEBUG_IS_VALID #ifdef DEBUG_IS_VALID #define DEB 1 #else #define DEB 0 #endif #define DUMPOUT cout #define dump(...) if(DEB) DUMPOUT<<" "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<" "; if(DEB) dump_func(__VA_ARGS__) template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;} template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; } template<typename T>ostream& operator << (ostream& os, set<T>& st){for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;} template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; } void dump_func(){DUMPOUT << endl;} template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);} template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;} template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;} void _main(); int main(){ cin.tie(0); ios::sync_with_stdio(false); _main(); return 0;} using ll = long long; using P = pair<int,int>; using Pl = pair<ll,ll>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; const int mod=1e9+7,INF=1<<29; const double EPS=1e-12,PI=3.1415926535897932384626; const ll lmod = 1e9+7,LINF=1LL<<59; void _main(){ int N; ll P; cin >> N >> P ; vl h(N+1); rep(i,N) cin >> h[i+1] ; h[0] = h[1]; vl dp1(N+1),dp2(N+1); dp2[0] = LINF; rep(i,N){ dp1[i+1] = min(min(dp1[i],dp2[i])+P,dp1[i]+max(0LL,h[i+1]-h[i])); dp2[i+1] = min(min(dp1[i],dp2[i])+P,dp2[i]+max(0LL,h[i]-h[i+1])); // dp1[i+1] = min(max(0LL,h[i+1]-h[i]),P)+min(dp1[i],dp2[i]+P); // dp2[i+1] = min(max(0LL,h[i+1]-h[i+2]),P)+min(dp1[i]+P,dp2[i]); } cout << min(dp1[N],dp2[N]) << endl; }