結果

問題 No.1077 Noelちゃんと星々4
ユーザー ningenMeningenMe
提出日時 2020-06-12 21:34:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 3,054 bytes
コンパイル時間 2,592 ms
コンパイル使用メモリ 207,784 KB
実行使用メモリ 42,368 KB
最終ジャッジ日時 2024-06-24 04:33:01
合計ジャッジ時間 3,400 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 34 ms
30,080 KB
testcase_03 AC 42 ms
38,016 KB
testcase_04 AC 14 ms
13,696 KB
testcase_05 AC 11 ms
11,136 KB
testcase_06 AC 18 ms
16,896 KB
testcase_07 AC 20 ms
19,072 KB
testcase_08 AC 16 ms
14,592 KB
testcase_09 AC 14 ms
12,928 KB
testcase_10 AC 43 ms
38,016 KB
testcase_11 AC 28 ms
25,856 KB
testcase_12 AC 24 ms
21,760 KB
testcase_13 AC 11 ms
10,624 KB
testcase_14 AC 41 ms
37,248 KB
testcase_15 AC 22 ms
21,120 KB
testcase_16 AC 16 ms
14,848 KB
testcase_17 AC 26 ms
23,552 KB
testcase_18 AC 43 ms
38,784 KB
testcase_19 AC 10 ms
10,240 KB
testcase_20 AC 2 ms
6,940 KB
testcase_21 AC 48 ms
42,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

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.1415926535897932384626433L;

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;}

int main() {
    int N,M=10000; cin >> N;
    vector<int> A(N);
    for(int i = 0; i < N; ++i) cin >> A[i];
    auto dp = multivector(N,M+1,0);
    for(int i = 0; i < N; ++i) {
        for(int j = A[i]; j <= M; ++j) dp[i][j]=j-A[i];
        for(int j = A[i]; 0 <= j; --j) dp[i][j]=A[i]-j;
    }    
    for(int i = 0; i+1 < N; ++i) {
        int mini = 123456789;
        for(int j = 0; j <= M; ++j) {
            chmin(mini,dp[i][j]);
            dp[i+1][j]+=mini;
        }
    }    
    cout << *min_element(ALL(dp.back())) << endl;
    return 0;
}
0