# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
938663 |
2024-03-05T12:05:59 Z |
Alebn |
Kitchen (BOI19_kitchen) |
C++14 |
|
74 ms |
3664 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, k, A, B;
vector<int> a, b;
vector<vector<bool>> dp;
signed main() {
cin >> n >> m >> k;
a = vector<int>(n), b = vector<int>(m);
for(int i = 0; i < n; i++) {
cin >> a[i];
A += a[i];
}
for(int i = 0; i < m; i++) {
cin >> b[i];
B += b[i];
}
//
dp = vector<vector<bool>>(m + 1, vector<bool>(B + 1, false));
dp[0][0] = true;
for(int i = 1; i <= m; i++) {
for(int j = 0; j <= B; j++) {
if(j >= b[i - 1]) dp[i][j] = dp[i - 1][j] | dp[i - 1][j - b[i - 1]];
//cout << dp[i][j] << " ";
}
//cout << "\n";
}
//
int res = LLONG_MAX;
for(int i = 0; i <= m; i++) {
for(int j = A; j <= B; j++) {
if(dp[i][j]) res = min(res, j - A);
}
}
if(res == LLONG_MAX) cout << "Impossible\n";
else cout << res << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
55 ms |
2548 KB |
Output is correct |
2 |
Correct |
38 ms |
1884 KB |
Output is correct |
3 |
Correct |
41 ms |
2140 KB |
Output is correct |
4 |
Correct |
73 ms |
3480 KB |
Output is correct |
5 |
Correct |
74 ms |
3664 KB |
Output is correct |
6 |
Correct |
32 ms |
1628 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |