結果
問題 | No.1037 exhausted |
ユーザー | uchiiii |
提出日時 | 2020-09-04 10:58:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 4,104 bytes |
コンパイル時間 | 3,303 ms |
コンパイル使用メモリ | 226,500 KB |
実行使用メモリ | 34,560 KB |
最終ジャッジ日時 | 2024-05-03 23:22:40 |
合計ジャッジ時間 | 4,532 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 36 ms
34,432 KB |
testcase_13 | AC | 35 ms
34,304 KB |
testcase_14 | AC | 35 ms
34,304 KB |
testcase_15 | AC | 35 ms
34,304 KB |
testcase_16 | AC | 36 ms
34,176 KB |
testcase_17 | AC | 36 ms
34,560 KB |
testcase_18 | AC | 36 ms
34,432 KB |
testcase_19 | AC | 38 ms
34,432 KB |
testcase_20 | AC | 30 ms
34,304 KB |
testcase_21 | AC | 30 ms
34,560 KB |
testcase_22 | AC | 30 ms
34,560 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("03") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; #define endl "\n" #define FOR(i,a,b) for(int i=(a);i<=(b);i++) #define rep(i,n) for(int i=0;i<(n);i++) #define PII pair<int, int> #define PLL pair<ll, ll> #define ALL(x) (x).begin(), (x).end() int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF))); template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } template<class T>inline int popcount(T a) {return __builtin_popcount(a);} template<class T>inline T emod(T a, T p) { return (a%p + p) % p;} template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;} template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } struct MyIO { MyIO(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } IO_OI; #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif //------------------- constexpr int MX = 2005; int main() { int N,V,L;cin>>N>>V>>L; auto dp = vec(N+2, vec(V+1, LINF)); dp[0][V] = 0; int prev = 0; ll v=0,w=0; int x; rep(i,N) { cin>>x; rep(j, V+1) { if(dp[i][j]==LINF) continue; if(j >= x-prev) chmin(dp[i+1][j-(x-prev)], dp[i][j]); int next = min((ll)j+v,(ll) V)-(x-prev); if(next>=0) chmin(dp[i+1][next], dp[i][j]+w); } cin>>v>>w; prev = x; } { x = L; rep(j, V+1) { if(dp[N][j]==LINF) continue; if(j >= x-prev) chmin(dp[N+1][j-(x-prev)], dp[N][j]); int next = min((ll)j+v,(ll) V)-(x-prev); if(next>=0) chmin(dp[N+1][next], dp[N][j]+w); } } debug(dp); ll ans = LINF; rep(i, V+1) chmin(ans, dp[N+1][i]); cout << (ans==LINF? -1: ans) << endl; }