結果

問題 No.1037 exhausted
ユーザー ningenMeningenMe
提出日時 2020-04-24 21:49:41
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 3,136 bytes
コンパイル時間 1,692 ms
コンパイル使用メモリ 174,296 KB
実行使用メモリ 34,688 KB
最終ジャッジ日時 2024-10-15 02:42:15
合計ジャッジ時間 2,951 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 1 ms
6,820 KB
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 2 ms
6,820 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 39 ms
34,432 KB
testcase_13 AC 39 ms
34,432 KB
testcase_14 AC 39 ms
34,304 KB
testcase_15 AC 39 ms
34,560 KB
testcase_16 AC 38 ms
34,304 KB
testcase_17 AC 39 ms
34,432 KB
testcase_18 AC 39 ms
34,432 KB
testcase_19 AC 39 ms
34,432 KB
testcase_20 AC 40 ms
34,304 KB
testcase_21 AC 40 ms
34,560 KB
testcase_22 AC 38 ms
34,688 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() {
    SPEED
    ll N,V,L; cin >> N >> V >> L;
    vector<ll> x(N+2),v(N+2),w(N+2);
    for(int i = 1; i <= N; ++i) {
        cin >> x[i] >> v[i] >> w[i];
    }
    x[N+1] = L;
    auto dp = multivector(N+2,V+1,LOWINF);
    dp[0][V] = 0;
    for(int i = 1; i <= N+1; ++i) {
        ll d = x[i]-x[i-1];
        for(int j = 0; j <= V; ++j) {
            if(j+d<=V) chmin(dp[i][j],dp[i-1][j+d]);
        }
        for(int j = V; 0 <= j; --j) {
            chmin(dp[i][min(j+v[i],V)],dp[i][j]+w[i]);
        }
    }
    ll ans = *min_element(ALL(dp[N+1]));
    if(ans==LOWINF) ans = -1;
    cout << ans << endl;
    return 0;
}
0