結果
問題 | No.288 貯金箱の仕事 |
ユーザー | kei |
提出日時 | 2018-10-05 23:31:57 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,837 bytes |
コンパイル時間 | 1,613 ms |
コンパイル使用メモリ | 174,960 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-10-12 13:26:47 |
合計ジャッジ時間 | 3,671 ms |
ジャッジサーバーID (参考情報) |
judge / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 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,816 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | AC | 2 ms
6,816 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/288> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ ll solve(){ ll res = LINF; ll N,M; cin >> N >> M; vector<ll> A(N),K(N); for(auto& in:A) cin >> in; for(auto& in:K) cin >> in; reverse(A.begin(),A.end()); reverse(K.begin(),K.end()); ll base = 1000; for(int i = 0; i < N;i++){ if(M<=base)break; ll C = min(K[i],(M-base)/A[i]); M -= A[i]*C; K[i] -= C; } reverse(A.begin(),A.end()); reverse(K.begin(),K.end()); vector<ll> min_ret(base,LINF); min_ret[0] = 0; for(int i = 0; i < base;i++){ if(min_ret[i] == LINF) continue; for(int j = 0; j < N;j++){ if(i+A[j]<base){ min_ret[i+A[j]] = min(min_ret[i+A[j]],min_ret[i]+1); } } } ll now = accumulate(K.begin(),K.end(),0LL); vector<vector<ll>> max_send(N+1,vector<ll>(2*base,-1)); max_send[0][0] = 0; for(int i = 0; i < N;i++){ for(int j = 0; j < 2*base;j++){ if(max_send[i][j]==-1)continue; for(int k = 0; k <= K[i]; k++){ if(j+A[i]*k>=2*base) break; max_send[i+1][j+A[i]*k] = max(max_send[i+1][j+A[i]*k],max_send[i][j]+k); } } } for(ll m = M; m < base; m++){ if(max_send[N][m]==-1) continue; if(min_ret[m-M]==LINF) continue; ll c1 = max_send[N][m]; ll c2 = min_ret[m-M]; res = min(res,now-c1+c2); } if(res == LINF) res = -1; return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }