#include <bits/stdc++.h>
using namespace std;
using idata = vector<int>;
using igrid = vector<idata>;
const int MAX_N = 20;
const int MAX_M = 20;
const int MAX_MASK = 1 << MAX_M;
int dp[MAX_MASK];
idata salary;
igrid transitions;
int main () {
int N, M; cin >> N >> M;
salary.resize(N);
transitions.resize(N);
for (int iN = 0; iN < N; iN ++) {
int x;
cin >> x;
salary[iN] = x;
}
for (int iM = 0; iM < M; iM ++) {
int x;
cin >> x;
for (int mask = 0; mask < (1 << iM); mask ++)
dp[mask + (1 << iM)] = dp[mask] + x;
}
for (int mask = 0; mask < (1 << M); mask ++) {
for (int i = 0; i < N; i ++) {
if (dp[mask] != salary[i]) continue ;
transitions[i].push_back(mask);
}
}
unordered_set<int> mask_array; mask_array.insert(0);
for (int i = 0; i < N; i ++) {
unordered_set<int> next_mask_array;
for (int mask : mask_array) {
for (int next : transitions[i]) {
if (next & mask) continue ;
next_mask_array.insert(next | mask);
}
}
mask_array = next_mask_array;
}
if (mask_array.size() != 0) cout << "YES\n";
else cout << "NO\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
5 ms |
4400 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
6 ms |
4948 KB |
Output is correct |
9 |
Correct |
6 ms |
4312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
312 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
308 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 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 |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
304 KB |
Output is correct |
10 |
Correct |
1 ms |
312 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
5 ms |
4400 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
6 ms |
4948 KB |
Output is correct |
9 |
Correct |
6 ms |
4312 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
312 KB |
Output is correct |
12 |
Correct |
1 ms |
312 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
308 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 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 |
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 |
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 |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
1 ms |
304 KB |
Output is correct |
29 |
Correct |
1 ms |
312 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
7 ms |
4436 KB |
Output is correct |
32 |
Correct |
78 ms |
5192 KB |
Output is correct |
33 |
Correct |
10 ms |
4404 KB |
Output is correct |
34 |
Correct |
12 ms |
4276 KB |
Output is correct |
35 |
Correct |
13 ms |
4308 KB |
Output is correct |
36 |
Correct |
27 ms |
4308 KB |
Output is correct |
37 |
Correct |
6 ms |
4400 KB |
Output is correct |
38 |
Correct |
8 ms |
4408 KB |
Output is correct |
39 |
Correct |
99 ms |
15656 KB |
Output is correct |
40 |
Correct |
12 ms |
4308 KB |
Output is correct |
41 |
Correct |
21 ms |
4308 KB |
Output is correct |
42 |
Correct |
13 ms |
4564 KB |
Output is correct |
43 |
Correct |
12 ms |
4404 KB |
Output is correct |
44 |
Correct |
16 ms |
4404 KB |
Output is correct |
45 |
Correct |
8 ms |
4660 KB |
Output is correct |
46 |
Correct |
9 ms |
4436 KB |
Output is correct |
47 |
Correct |
16 ms |
4400 KB |
Output is correct |
48 |
Correct |
5 ms |
4692 KB |
Output is correct |
49 |
Correct |
4 ms |
4308 KB |
Output is correct |
50 |
Correct |
401 ms |
15660 KB |
Output is correct |
51 |
Correct |
13 ms |
4464 KB |
Output is correct |
52 |
Correct |
17 ms |
4552 KB |
Output is correct |
53 |
Correct |
954 ms |
13672 KB |
Output is correct |
54 |
Correct |
510 ms |
15732 KB |
Output is correct |
55 |
Correct |
454 ms |
15664 KB |
Output is correct |
56 |
Correct |
495 ms |
16548 KB |
Output is correct |
57 |
Correct |
445 ms |
16440 KB |
Output is correct |
58 |
Correct |
528 ms |
16492 KB |
Output is correct |