# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
745530 |
2023-05-20T09:58:09 Z |
zjsxzy |
Bank (IZhO14_bank) |
C++17 |
|
102 ms |
8636 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (auto& x: a) cin >> x;
for (auto& x: b) cin >> x;
vector covered(1 << m, -1), left(1 << m, -1);
covered[0] = 0;
left[0] = 0;
for (int i = 0; i < (1 << m); i++) {
if (covered[i] == -1) continue;
int target = a[covered[i]];
for (int j = 0; j < m; j++) {
if (!(i >> j & 1)) {
if (left[i] + b[j] == target && covered[i] + 1 >= covered[i | (1 << j)]) {
covered[i | (1 << j)] = covered[i] + 1;
left[i | (1 << j)] = 0;
} else if (left[i] + b[j] < target && covered[i] >= covered[i | (1 << j)]) {
covered[i | (1 << j)] = covered[i];
left[i | (1 << j)] = left[i] + b[j];
}
}
}
if (covered[i] == n) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int ts = 1;
// cin >> ts;
for (int t = 1; t <= ts; t++) {
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
320 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
596 KB |
Output is correct |
5 |
Correct |
6 ms |
8512 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
4 ms |
8532 KB |
Output is correct |
9 |
Correct |
90 ms |
8616 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 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 |
1 ms |
320 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 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 |
1 ms |
444 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 |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
452 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 |
2 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
320 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
596 KB |
Output is correct |
5 |
Correct |
6 ms |
8512 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
4 ms |
8532 KB |
Output is correct |
9 |
Correct |
90 ms |
8616 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
320 KB |
Output is correct |
13 |
Correct |
1 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 |
1 ms |
320 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
444 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 |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
452 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 |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
78 ms |
8532 KB |
Output is correct |
32 |
Correct |
91 ms |
8528 KB |
Output is correct |
33 |
Correct |
11 ms |
8548 KB |
Output is correct |
34 |
Correct |
4 ms |
8516 KB |
Output is correct |
35 |
Correct |
5 ms |
8532 KB |
Output is correct |
36 |
Correct |
7 ms |
8532 KB |
Output is correct |
37 |
Correct |
6 ms |
8548 KB |
Output is correct |
38 |
Correct |
4 ms |
8512 KB |
Output is correct |
39 |
Correct |
6 ms |
8532 KB |
Output is correct |
40 |
Correct |
5 ms |
8532 KB |
Output is correct |
41 |
Correct |
5 ms |
8532 KB |
Output is correct |
42 |
Correct |
47 ms |
8540 KB |
Output is correct |
43 |
Correct |
6 ms |
8532 KB |
Output is correct |
44 |
Correct |
5 ms |
8508 KB |
Output is correct |
45 |
Correct |
4 ms |
8532 KB |
Output is correct |
46 |
Correct |
23 ms |
8616 KB |
Output is correct |
47 |
Correct |
4 ms |
8532 KB |
Output is correct |
48 |
Correct |
4 ms |
8548 KB |
Output is correct |
49 |
Correct |
7 ms |
8516 KB |
Output is correct |
50 |
Correct |
92 ms |
8532 KB |
Output is correct |
51 |
Correct |
5 ms |
8532 KB |
Output is correct |
52 |
Correct |
9 ms |
8532 KB |
Output is correct |
53 |
Correct |
102 ms |
8636 KB |
Output is correct |
54 |
Correct |
91 ms |
8532 KB |
Output is correct |
55 |
Correct |
96 ms |
8528 KB |
Output is correct |
56 |
Correct |
85 ms |
8532 KB |
Output is correct |
57 |
Correct |
87 ms |
8532 KB |
Output is correct |
58 |
Correct |
89 ms |
8536 KB |
Output is correct |