結果
問題 |
No.288 貯金箱の仕事
|
ユーザー |
![]() |
提出日時 | 2018-10-06 00:03:12 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 229 ms / 2,000 ms |
コード長 | 2,126 bytes |
コンパイル時間 | 2,482 ms |
コンパイル使用メモリ | 170,596 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-12 13:29:50 |
合計ジャッジ時間 | 6,019 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
#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; ll T = 0; for(int i = 0; i < N;i++) T += A[i]*K[i]; if(T < M) return -1; T -= M; ll MaxA = A[N-1]; vector<ll> min_ret(MaxA*MaxA+1,LINF); min_ret[0] = 0; for(int i = 0; i <= MaxA*MaxA;i++){ if(min_ret[i] == LINF) continue; for(int j = 0; j < N;j++){ if(i+A[j]<=MaxA*MaxA){ min_ret[i+A[j]] = min(min_ret[i+A[j]],min_ret[i]+1); } } } ll C = 0; if(T>=MaxA*MaxA){ C = (T-MaxA*MaxA+MaxA)/MaxA; T -= MaxA*C; } if(min_ret[T] == LINF) return -1; res = min_ret[T] + C; return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }