# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
348947 |
2021-01-16T06:50:52 Z |
8e7 |
Bank (IZhO14_bank) |
C++14 |
|
358 ms |
98924 KB |
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <set>
#define maxn 20
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
set<pii> dp[1<<maxn];
int a[maxn], b[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0;i < n;i++) cin >> a[i];
for (int j = 0;j < m;j++) cin >> b[j];
dp[0].insert(make_pair(0, 0));
int poss = 0;
for (int i = 1;i < (1<<m);i++) {
for (int j = 0;j < m;j++) {
if (i & (1<<j)) {
for (auto v: dp[i - (1<<j)]) {
if (v.ss + b[j] == a[v.ff]) {
dp[i].insert(make_pair(v.ff + 1, 0));
} else if (v.ss + b[j] < a[v.ff]) {
dp[i].insert(make_pair(v.ff, v.ss + b[j]));
}
}
}
}
for (auto j:dp[i]) {
if (j.ff == n) {
poss = 1;
break;
}
}
}
cout << (poss ? "YES" : "NO") << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
49644 KB |
Output is correct |
2 |
Correct |
32 ms |
49516 KB |
Output is correct |
3 |
Correct |
33 ms |
49644 KB |
Output is correct |
4 |
Correct |
37 ms |
49900 KB |
Output is correct |
5 |
Correct |
122 ms |
49772 KB |
Output is correct |
6 |
Correct |
35 ms |
49516 KB |
Output is correct |
7 |
Correct |
33 ms |
49644 KB |
Output is correct |
8 |
Correct |
223 ms |
71788 KB |
Output is correct |
9 |
Correct |
339 ms |
98820 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
49644 KB |
Output is correct |
2 |
Correct |
34 ms |
49516 KB |
Output is correct |
3 |
Correct |
34 ms |
49664 KB |
Output is correct |
4 |
Correct |
34 ms |
49516 KB |
Output is correct |
5 |
Correct |
37 ms |
49772 KB |
Output is correct |
6 |
Correct |
33 ms |
49664 KB |
Output is correct |
7 |
Correct |
34 ms |
49644 KB |
Output is correct |
8 |
Correct |
33 ms |
49644 KB |
Output is correct |
9 |
Correct |
38 ms |
49516 KB |
Output is correct |
10 |
Correct |
33 ms |
49516 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
49516 KB |
Output is correct |
2 |
Correct |
35 ms |
49772 KB |
Output is correct |
3 |
Correct |
35 ms |
49644 KB |
Output is correct |
4 |
Correct |
34 ms |
49644 KB |
Output is correct |
5 |
Correct |
34 ms |
49516 KB |
Output is correct |
6 |
Correct |
34 ms |
49516 KB |
Output is correct |
7 |
Correct |
34 ms |
49644 KB |
Output is correct |
8 |
Correct |
36 ms |
49644 KB |
Output is correct |
9 |
Correct |
35 ms |
49516 KB |
Output is correct |
10 |
Correct |
35 ms |
49536 KB |
Output is correct |
11 |
Correct |
36 ms |
50284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
49644 KB |
Output is correct |
2 |
Correct |
32 ms |
49516 KB |
Output is correct |
3 |
Correct |
33 ms |
49644 KB |
Output is correct |
4 |
Correct |
37 ms |
49900 KB |
Output is correct |
5 |
Correct |
122 ms |
49772 KB |
Output is correct |
6 |
Correct |
35 ms |
49516 KB |
Output is correct |
7 |
Correct |
33 ms |
49644 KB |
Output is correct |
8 |
Correct |
223 ms |
71788 KB |
Output is correct |
9 |
Correct |
339 ms |
98820 KB |
Output is correct |
10 |
Correct |
33 ms |
49644 KB |
Output is correct |
11 |
Correct |
34 ms |
49516 KB |
Output is correct |
12 |
Correct |
34 ms |
49664 KB |
Output is correct |
13 |
Correct |
34 ms |
49516 KB |
Output is correct |
14 |
Correct |
37 ms |
49772 KB |
Output is correct |
15 |
Correct |
33 ms |
49664 KB |
Output is correct |
16 |
Correct |
34 ms |
49644 KB |
Output is correct |
17 |
Correct |
33 ms |
49644 KB |
Output is correct |
18 |
Correct |
38 ms |
49516 KB |
Output is correct |
19 |
Correct |
33 ms |
49516 KB |
Output is correct |
20 |
Correct |
34 ms |
49516 KB |
Output is correct |
21 |
Correct |
35 ms |
49772 KB |
Output is correct |
22 |
Correct |
35 ms |
49644 KB |
Output is correct |
23 |
Correct |
34 ms |
49644 KB |
Output is correct |
24 |
Correct |
34 ms |
49516 KB |
Output is correct |
25 |
Correct |
34 ms |
49516 KB |
Output is correct |
26 |
Correct |
34 ms |
49644 KB |
Output is correct |
27 |
Correct |
36 ms |
49644 KB |
Output is correct |
28 |
Correct |
35 ms |
49516 KB |
Output is correct |
29 |
Correct |
35 ms |
49536 KB |
Output is correct |
30 |
Correct |
36 ms |
50284 KB |
Output is correct |
31 |
Correct |
329 ms |
91244 KB |
Output is correct |
32 |
Correct |
335 ms |
96620 KB |
Output is correct |
33 |
Correct |
139 ms |
52716 KB |
Output is correct |
34 |
Correct |
123 ms |
49772 KB |
Output is correct |
35 |
Correct |
121 ms |
49772 KB |
Output is correct |
36 |
Correct |
119 ms |
49516 KB |
Output is correct |
37 |
Correct |
120 ms |
49644 KB |
Output is correct |
38 |
Correct |
118 ms |
49644 KB |
Output is correct |
39 |
Correct |
176 ms |
61932 KB |
Output is correct |
40 |
Correct |
122 ms |
49516 KB |
Output is correct |
41 |
Correct |
119 ms |
49644 KB |
Output is correct |
42 |
Correct |
259 ms |
73480 KB |
Output is correct |
43 |
Correct |
126 ms |
50420 KB |
Output is correct |
44 |
Correct |
124 ms |
49516 KB |
Output is correct |
45 |
Correct |
236 ms |
69100 KB |
Output is correct |
46 |
Correct |
177 ms |
59372 KB |
Output is correct |
47 |
Correct |
121 ms |
49788 KB |
Output is correct |
48 |
Correct |
160 ms |
57196 KB |
Output is correct |
49 |
Correct |
119 ms |
49516 KB |
Output is correct |
50 |
Correct |
341 ms |
98796 KB |
Output is correct |
51 |
Correct |
125 ms |
50412 KB |
Output is correct |
52 |
Correct |
134 ms |
51692 KB |
Output is correct |
53 |
Correct |
343 ms |
98668 KB |
Output is correct |
54 |
Correct |
345 ms |
98796 KB |
Output is correct |
55 |
Correct |
342 ms |
98760 KB |
Output is correct |
56 |
Correct |
358 ms |
98924 KB |
Output is correct |
57 |
Correct |
350 ms |
98796 KB |
Output is correct |
58 |
Correct |
347 ms |
98924 KB |
Output is correct |