#include<bits/stdc++.h>
using namespace std;
const int maxn = 22, maxb = (1 << maxn);
int a[maxn], b[maxn], dp[maxb], left_val[maxb];
int n, m;
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];
bool ch = 0;
for(int mask = 1; mask < (1 << m); mask++)
{
dp[mask] = 0;
//cout << mask << " : " << endl;
for(int i = 0; i < m; i++)
{
if(((mask >> i) & 1))
{
int mask2 = mask ^ (1 << i);
int tmp = dp[mask2];
int val = left_val[mask2] + b[i];
if(val > a[tmp])
continue;
// cout << mask2 << " , " << left_val[mask2] << endl;
if(tmp + (val == a[tmp]) >= dp[mask])
{
dp[mask] = tmp + (val == a[tmp]);
left_val[mask] = (val == a[tmp]) ? 0 : val;
}
}
}
if(dp[mask] == n)
ch = true;
}
if(ch)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
4 ms |
468 KB |
Output is correct |
5 |
Correct |
75 ms |
8484 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
88 ms |
8472 KB |
Output is correct |
9 |
Correct |
80 ms |
8540 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 |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 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 |
212 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 |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
2 ms |
436 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
432 KB |
Output is correct |
10 |
Correct |
2 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
432 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
4 ms |
468 KB |
Output is correct |
5 |
Correct |
75 ms |
8484 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
88 ms |
8472 KB |
Output is correct |
9 |
Correct |
80 ms |
8540 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 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 |
436 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
432 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
432 KB |
Output is correct |
31 |
Correct |
97 ms |
8508 KB |
Output is correct |
32 |
Correct |
98 ms |
8396 KB |
Output is correct |
33 |
Correct |
128 ms |
8416 KB |
Output is correct |
34 |
Correct |
112 ms |
8460 KB |
Output is correct |
35 |
Correct |
102 ms |
8428 KB |
Output is correct |
36 |
Correct |
70 ms |
8488 KB |
Output is correct |
37 |
Correct |
96 ms |
8396 KB |
Output is correct |
38 |
Correct |
75 ms |
8472 KB |
Output is correct |
39 |
Correct |
86 ms |
8428 KB |
Output is correct |
40 |
Correct |
81 ms |
8488 KB |
Output is correct |
41 |
Correct |
79 ms |
8416 KB |
Output is correct |
42 |
Correct |
126 ms |
8492 KB |
Output is correct |
43 |
Correct |
111 ms |
8424 KB |
Output is correct |
44 |
Correct |
100 ms |
8444 KB |
Output is correct |
45 |
Correct |
131 ms |
8400 KB |
Output is correct |
46 |
Correct |
132 ms |
8456 KB |
Output is correct |
47 |
Correct |
84 ms |
8396 KB |
Output is correct |
48 |
Correct |
85 ms |
8424 KB |
Output is correct |
49 |
Correct |
82 ms |
8604 KB |
Output is correct |
50 |
Correct |
76 ms |
8452 KB |
Output is correct |
51 |
Correct |
85 ms |
8528 KB |
Output is correct |
52 |
Correct |
71 ms |
8492 KB |
Output is correct |
53 |
Correct |
90 ms |
8384 KB |
Output is correct |
54 |
Correct |
83 ms |
8604 KB |
Output is correct |
55 |
Correct |
70 ms |
8400 KB |
Output is correct |
56 |
Correct |
75 ms |
8420 KB |
Output is correct |
57 |
Correct |
72 ms |
8380 KB |
Output is correct |
58 |
Correct |
73 ms |
8436 KB |
Output is correct |