제출 #746053

#제출 시각아이디문제언어결과실행 시간메모리
746053vjudge1Kitchen (BOI19_kitchen)C++11
72 / 100
82 ms696 KiB
#include <bits/stdc++.h> using namespace std; int n,m,k; int a[301]; int b[301]; int sum=0; int w=1000; void subtask3() { vector<bool> g; vector<int> krit; g.assign(sum+1+w+w,0); krit.assign(sum+1+w+w,0); g[w]=1; for (int i=1;i<=m;i++) { for (int j=min(i*w,sum+w);j>max(0,sum-(m-i)*w-w);j--) { if (g[j+w-b[i]]==1) { g[j+w]=1; krit[j+w]=max(krit[j+w],krit[j+w-b[i]]+min(b[i],n)); } } } int ans=-1; for (int i=sum+w;i<sum+w+w;i++) { if (g[i] && (krit[i]>=n*k)) { ans=i-w; break; } } /* for (int i=0;i<g.size();i++) { cout << i << ": " << g[i] << endl; } cout << endl; */ if (ans==-1) { cout << "Impossible" << endl; } else { cout << ans-sum << endl; } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> k; for (int i=1;i<=n;i++) { cin >> a[i]; sum+=a[i]; } for (int i=1;i<=m;i++) { cin >> b[i]; } for (int i=1;i<=n;i++) { if (a[i]<k) { cout << "Impossible" << endl; return(0); } } subtask3(); return 0; } /* 1 8 1 100 12 56 8 23 6 4 59 163 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...