# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
340087 |
2020-12-26T21:10:06 Z |
_ani |
Bank (IZhO14_bank) |
C++17 |
|
426 ms |
52920 KB |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
vector<int> dp[22];
vector<int> sums[1002];
int su[1002][22];
int a[22], b[22];
int n, m;
int used[22][(1 << 20) + 1];
int getsum(int mask)
{
int res = 0;
int ind = m - 1;
while (mask)
{
if (mask & 1)
res += b[ind];
mask >>= 1;
ind--;
}
return res;
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 1; i < (1 << m); i++)
if (getsum(i) <= 1000) {
sums[getsum(i)].push_back(i);
}
for (auto s : sums[a[0]])
used[0][s] = 1;
for (auto i : sums[a[0]])
dp[0].push_back(i);
for (int i = 1; i < n; i++)
{
if (dp[i - 1].empty())
{
cout << "NO\n";
return 0;
}
for (int j = 0; j < (int)dp[i - 1].size(); j++)
for (auto k: sums[a[i]])
if ((dp[i - 1][j] & k) == 0 && used[i][dp[i - 1][j] | k] == 0)
{
dp[i].push_back(dp[i - 1][j] | k);
used[i][dp[i - 1][j] | k] = 1;
}
}
if (dp[n - 1].empty())
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
4 ms |
748 KB |
Output is correct |
5 |
Correct |
131 ms |
7148 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
130 ms |
9836 KB |
Output is correct |
9 |
Correct |
130 ms |
6508 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
2 ms |
364 KB |
Output is correct |
4 |
Correct |
2 ms |
492 KB |
Output is correct |
5 |
Correct |
2 ms |
492 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
2 ms |
492 KB |
Output is correct |
8 |
Correct |
2 ms |
492 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
364 KB |
Output is correct |
11 |
Correct |
2 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
4 ms |
748 KB |
Output is correct |
5 |
Correct |
131 ms |
7148 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
130 ms |
9836 KB |
Output is correct |
9 |
Correct |
130 ms |
6508 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
1 ms |
364 KB |
Output is correct |
17 |
Correct |
1 ms |
364 KB |
Output is correct |
18 |
Correct |
1 ms |
384 KB |
Output is correct |
19 |
Correct |
1 ms |
364 KB |
Output is correct |
20 |
Correct |
1 ms |
492 KB |
Output is correct |
21 |
Correct |
2 ms |
492 KB |
Output is correct |
22 |
Correct |
2 ms |
364 KB |
Output is correct |
23 |
Correct |
2 ms |
492 KB |
Output is correct |
24 |
Correct |
2 ms |
492 KB |
Output is correct |
25 |
Correct |
1 ms |
364 KB |
Output is correct |
26 |
Correct |
2 ms |
492 KB |
Output is correct |
27 |
Correct |
2 ms |
492 KB |
Output is correct |
28 |
Correct |
2 ms |
384 KB |
Output is correct |
29 |
Correct |
2 ms |
364 KB |
Output is correct |
30 |
Correct |
2 ms |
492 KB |
Output is correct |
31 |
Correct |
117 ms |
8684 KB |
Output is correct |
32 |
Correct |
182 ms |
9964 KB |
Output is correct |
33 |
Correct |
73 ms |
2284 KB |
Output is correct |
34 |
Correct |
64 ms |
492 KB |
Output is correct |
35 |
Correct |
65 ms |
636 KB |
Output is correct |
36 |
Correct |
65 ms |
492 KB |
Output is correct |
37 |
Correct |
66 ms |
492 KB |
Output is correct |
38 |
Correct |
66 ms |
492 KB |
Output is correct |
39 |
Correct |
154 ms |
22976 KB |
Output is correct |
40 |
Correct |
82 ms |
2156 KB |
Output is correct |
41 |
Correct |
69 ms |
1004 KB |
Output is correct |
42 |
Correct |
136 ms |
14060 KB |
Output is correct |
43 |
Correct |
84 ms |
2924 KB |
Output is correct |
44 |
Correct |
65 ms |
492 KB |
Output is correct |
45 |
Correct |
139 ms |
12936 KB |
Output is correct |
46 |
Correct |
96 ms |
6636 KB |
Output is correct |
47 |
Correct |
65 ms |
492 KB |
Output is correct |
48 |
Correct |
129 ms |
9452 KB |
Output is correct |
49 |
Correct |
129 ms |
6112 KB |
Output is correct |
50 |
Correct |
221 ms |
47608 KB |
Output is correct |
51 |
Correct |
133 ms |
12012 KB |
Output is correct |
52 |
Correct |
132 ms |
7112 KB |
Output is correct |
53 |
Correct |
426 ms |
17984 KB |
Output is correct |
54 |
Correct |
236 ms |
42940 KB |
Output is correct |
55 |
Correct |
219 ms |
47696 KB |
Output is correct |
56 |
Correct |
239 ms |
52920 KB |
Output is correct |
57 |
Correct |
234 ms |
49976 KB |
Output is correct |
58 |
Correct |
238 ms |
49976 KB |
Output is correct |