#include <bits/stdc++.h>
using namespace std;
constexpr int NMAX = 21;
int dp[(1<<NMAX)];
int last[(1<<NMAX)];
int N, M;
int A[NMAX], B[NMAX];
void Read () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
for (int i = 1; i <= N; ++ i )
cin >> A[i];
for (int i = 0; i < M; ++ i )
cin >> B[i];
}
void Solve () {
dp[0] = 0;
last[0] = 0;
for (int mask = 1; mask < (1<<M); ++ mask ) {
for (int i = 0; i < M; ++ i ) {
if ((mask&(1<<i)) == 0) continue;
int bef_state = mask^(1<<i);
int current = last[bef_state] + B[i];
if (current > A[dp[bef_state]+1]) continue;
int new_reach = dp[bef_state] + (current == A[dp[bef_state]+1]);
int new_last = (current == A[dp[bef_state]+1] ? 0 : current);
if (new_reach > dp[mask]) {
dp[mask] = new_reach;
last[mask] = new_last;
}
else if (new_reach == dp[mask]) last[mask] = new_last;
}
if (dp[mask] == N) {
cout << "YES\n";
return;
}
}
cout << "NO\n";
}
int main () {
Read();
Solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
79 ms |
4396 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
68 ms |
4456 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
324 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 |
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 |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
452 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 |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
452 KB |
Output is correct |
10 |
Correct |
2 ms |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
79 ms |
4396 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
68 ms |
4456 KB |
Output is correct |
10 |
Correct |
0 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
324 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 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 |
340 KB |
Output is correct |
23 |
Correct |
2 ms |
452 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 |
468 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
452 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
102 ms |
8284 KB |
Output is correct |
32 |
Correct |
102 ms |
8524 KB |
Output is correct |
33 |
Correct |
126 ms |
8396 KB |
Output is correct |
34 |
Correct |
119 ms |
8416 KB |
Output is correct |
35 |
Correct |
114 ms |
8416 KB |
Output is correct |
36 |
Correct |
75 ms |
6476 KB |
Output is correct |
37 |
Correct |
100 ms |
7240 KB |
Output is correct |
38 |
Correct |
71 ms |
4392 KB |
Output is correct |
39 |
Correct |
1 ms |
212 KB |
Output is correct |
40 |
Correct |
89 ms |
8524 KB |
Output is correct |
41 |
Correct |
75 ms |
4944 KB |
Output is correct |
42 |
Correct |
138 ms |
8460 KB |
Output is correct |
43 |
Correct |
125 ms |
7572 KB |
Output is correct |
44 |
Correct |
92 ms |
4396 KB |
Output is correct |
45 |
Correct |
1 ms |
324 KB |
Output is correct |
46 |
Correct |
135 ms |
8412 KB |
Output is correct |
47 |
Correct |
89 ms |
6588 KB |
Output is correct |
48 |
Correct |
1 ms |
328 KB |
Output is correct |
49 |
Correct |
75 ms |
4416 KB |
Output is correct |
50 |
Correct |
81 ms |
8520 KB |
Output is correct |
51 |
Correct |
91 ms |
8396 KB |
Output is correct |
52 |
Correct |
83 ms |
8404 KB |
Output is correct |
53 |
Correct |
96 ms |
8464 KB |
Output is correct |
54 |
Correct |
85 ms |
8432 KB |
Output is correct |
55 |
Correct |
82 ms |
8396 KB |
Output is correct |
56 |
Correct |
78 ms |
8424 KB |
Output is correct |
57 |
Correct |
80 ms |
8520 KB |
Output is correct |
58 |
Correct |
76 ms |
8460 KB |
Output is correct |