| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 830995 |
2023-08-19T14:42:01 Z |
alex_2008 |
Bank (IZhO14_bank) |
C++14 |
|
100 ms |
8612 KB |
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
const int N = 20;
int a[N], b[N];
pair <int, int> dp[(1 << N)];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
dp[0] = {0, 0};
for (int i = 1; i < (1 << m); i++) {
dp[i] = {-1, -1};
pair <int, int> ans = {-1, -1};
for (int j = 0; j < m; j++) {
if (i & (1 << j)) {
if (dp[i ^ (1 << j)] != make_pair(-1, -1)) {
pair <int, int> cur_ans = {-1, -1};
pair <int, int> cur = dp[i ^ (1 << j)];
if (cur.second + b[j] > a[cur.first]) {
continue;
}
if (cur.second + b[j] == a[cur.first]) {
cur_ans = {cur.first + 1, 0};
}
else {
cur_ans = {cur.first, cur.second + b[j]};
}
ans = max(ans, cur_ans);
}
}
}
dp[i] = ans;
if (dp[i].first == n) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
308 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
71 ms |
8400 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
304 KB |
Output is correct |
| 9 |
Correct |
81 ms |
8492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
308 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
436 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
308 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
71 ms |
8400 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
304 KB |
Output is correct |
| 9 |
Correct |
81 ms |
8492 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
308 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
2 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
436 KB |
Output is correct |
| 26 |
Correct |
2 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
1 ms |
340 KB |
Output is correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
93 ms |
8424 KB |
Output is correct |
| 32 |
Correct |
91 ms |
8380 KB |
Output is correct |
| 33 |
Correct |
73 ms |
8380 KB |
Output is correct |
| 34 |
Correct |
68 ms |
8436 KB |
Output is correct |
| 35 |
Correct |
69 ms |
8492 KB |
Output is correct |
| 36 |
Correct |
76 ms |
8376 KB |
Output is correct |
| 37 |
Correct |
75 ms |
8472 KB |
Output is correct |
| 38 |
Correct |
76 ms |
8396 KB |
Output is correct |
| 39 |
Correct |
1 ms |
212 KB |
Output is correct |
| 40 |
Correct |
76 ms |
8432 KB |
Output is correct |
| 41 |
Correct |
69 ms |
8432 KB |
Output is correct |
| 42 |
Correct |
100 ms |
8372 KB |
Output is correct |
| 43 |
Correct |
70 ms |
8492 KB |
Output is correct |
| 44 |
Correct |
72 ms |
8392 KB |
Output is correct |
| 45 |
Correct |
1 ms |
340 KB |
Output is correct |
| 46 |
Correct |
83 ms |
8388 KB |
Output is correct |
| 47 |
Correct |
69 ms |
8404 KB |
Output is correct |
| 48 |
Correct |
0 ms |
212 KB |
Output is correct |
| 49 |
Correct |
73 ms |
8480 KB |
Output is correct |
| 50 |
Correct |
79 ms |
8452 KB |
Output is correct |
| 51 |
Correct |
75 ms |
8372 KB |
Output is correct |
| 52 |
Correct |
68 ms |
8396 KB |
Output is correct |
| 53 |
Correct |
93 ms |
8432 KB |
Output is correct |
| 54 |
Correct |
91 ms |
8380 KB |
Output is correct |
| 55 |
Correct |
78 ms |
8436 KB |
Output is correct |
| 56 |
Correct |
84 ms |
8436 KB |
Output is correct |
| 57 |
Correct |
83 ms |
8612 KB |
Output is correct |
| 58 |
Correct |
83 ms |
8476 KB |
Output is correct |
