Submission #783916

#TimeUsernameProblemLanguageResultExecution timeMemory
783916TheOpChickenKitchen (BOI19_kitchen)C++17
0 / 100
20 ms468 KiB
#include <iostream> using namespace std; const int maxN = 350; int dp[maxN*maxN], barr[maxN]; int main(){ int n, m, k; cin >> n >> m >> k; bool pos = 1; int t1 = 0, t2 = 0; for (int i = 0; i < n; i++){ int a; cin >> a; if (a < k) pos = 0; t1 += a; } for (int i = 0; i < m; i++){ cin >> barr[i]; t2 += barr[i]; } if (!pos){ cout << "Impossible" << endl; return 0; } for (int i = 1; i <= t2; i++) dp[i] = -1e9; dp[barr[0]] = min(barr[0], n); for (int i = 1; i < m; i++){ for (int j = 0; j <= t2; j++){ if (barr[i] <= j) dp[j] = max(dp[j], dp[j-barr[i]] + min(barr[i], n)); } } for (int i = t1; i <= t2; i++){ if (dp[i] >= n*k){ cout << i-t1 << endl; return 0; } } cout << "Impossible" << endl; }
#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...