# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
656383 |
2022-11-07T08:24:43 Z |
boykut |
Bank (IZhO14_bank) |
C++14 |
|
430 ms |
54820 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 22;
int a[N], b[N], dp[N][1<<N], n, m;
vector<int> can[1001];
int main() {
cin.tie()->sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int mx = *max_element(a, a+n);
for (int mask = 0; mask < (1<<m); mask++) {
int s = 0;
for (int i = 0; i < m; i++) {
if (((mask>>i)&1)) s += b[i];
}
if (s <= mx)
can[s].push_back(mask);
}
for (int mask : can[a[0]])
dp[0][mask] = 1;
for (int i = 1; i < n; i++) {
for (int mask = 0; mask < (1<<m); mask++) {
if (dp[i-1][mask] == 0) continue;
for (int p : can[a[i]]) {
if ((mask & p) == 0) {
dp[i][mask | p] |= dp[i-1][mask];
}
}
}
}
for (int mask = 0; mask < (1<<m); mask++) {
if (dp[n-1][mask] == 1)
return cout << "YES", 0;
}
return cout << "NO", 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
404 KB |
Output is correct |
5 |
Correct |
58 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
60 ms |
7088 KB |
Output is correct |
9 |
Correct |
66 ms |
6280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
340 KB |
Output is correct |
10 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
2 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 |
2 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
404 KB |
Output is correct |
5 |
Correct |
58 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
60 ms |
7088 KB |
Output is correct |
9 |
Correct |
66 ms |
6280 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
340 KB |
Output is correct |
13 |
Correct |
0 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
0 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
340 KB |
Output is correct |
17 |
Correct |
0 ms |
340 KB |
Output is correct |
18 |
Correct |
0 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
2 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 |
2 ms |
468 KB |
Output is correct |
31 |
Correct |
64 ms |
6948 KB |
Output is correct |
32 |
Correct |
134 ms |
10280 KB |
Output is correct |
33 |
Correct |
64 ms |
1912 KB |
Output is correct |
34 |
Correct |
66 ms |
596 KB |
Output is correct |
35 |
Correct |
68 ms |
476 KB |
Output is correct |
36 |
Correct |
76 ms |
572 KB |
Output is correct |
37 |
Correct |
59 ms |
356 KB |
Output is correct |
38 |
Correct |
62 ms |
344 KB |
Output is correct |
39 |
Correct |
82 ms |
16720 KB |
Output is correct |
40 |
Correct |
66 ms |
464 KB |
Output is correct |
41 |
Correct |
77 ms |
608 KB |
Output is correct |
42 |
Correct |
78 ms |
10276 KB |
Output is correct |
43 |
Correct |
66 ms |
1120 KB |
Output is correct |
44 |
Correct |
70 ms |
464 KB |
Output is correct |
45 |
Correct |
62 ms |
8808 KB |
Output is correct |
46 |
Correct |
63 ms |
4204 KB |
Output is correct |
47 |
Correct |
70 ms |
472 KB |
Output is correct |
48 |
Correct |
59 ms |
4480 KB |
Output is correct |
49 |
Correct |
58 ms |
340 KB |
Output is correct |
50 |
Correct |
174 ms |
54728 KB |
Output is correct |
51 |
Correct |
67 ms |
1992 KB |
Output is correct |
52 |
Correct |
74 ms |
5988 KB |
Output is correct |
53 |
Correct |
430 ms |
28000 KB |
Output is correct |
54 |
Correct |
199 ms |
52552 KB |
Output is correct |
55 |
Correct |
178 ms |
54820 KB |
Output is correct |
56 |
Correct |
172 ms |
54608 KB |
Output is correct |
57 |
Correct |
179 ms |
50772 KB |
Output is correct |
58 |
Correct |
178 ms |
50632 KB |
Output is correct |