#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> a, b, as, bs, dp;
int solve(int c) {
if (dp[c] != -1) return dp[c];
int &ret = dp[c];
ret = 0;
for (int i = 0; i < m; i++) {
if (not (c & (1 << i))) continue;
int j = solve(c - (1 << i));
if (j >= n or bs[c] < as[j + 1]) ret = max(ret, j);
else if (bs[c] == as[j + 1]) ret = max(ret, j + 1);
}
return ret;
}
int main() {
cin >> n >> m;
a.resize(n + 1, 0), as.resize(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
as[i] = a[i] + as[i - 1];
}
b.resize(m), bs.resize(1 << m, 0);
for (int i = 0; i < m; i++) {
cin >> b[i];
for (int c = 0; c < (1 << m); c++) {
if (c & (1 << i)) bs[c] += b[i];
}
}
dp.resize(1 << m, -1);
cout << (solve((1 << m) - 1) >= n ? "YES" : "NO") << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
4 ms |
512 KB |
Output is correct |
5 |
Correct |
208 ms |
8508 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
216 ms |
8512 KB |
Output is correct |
9 |
Correct |
206 ms |
8512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
296 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 |
296 KB |
Output is correct |
5 |
Correct |
1 ms |
296 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 |
296 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 |
3 ms |
428 KB |
Output is correct |
3 |
Correct |
2 ms |
424 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
428 KB |
Output is correct |
6 |
Correct |
2 ms |
428 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 |
340 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 |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
4 ms |
512 KB |
Output is correct |
5 |
Correct |
208 ms |
8508 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
216 ms |
8512 KB |
Output is correct |
9 |
Correct |
206 ms |
8512 KB |
Output is correct |
10 |
Correct |
1 ms |
296 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
296 KB |
Output is correct |
14 |
Correct |
1 ms |
296 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 |
296 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 |
3 ms |
428 KB |
Output is correct |
22 |
Correct |
2 ms |
424 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
428 KB |
Output is correct |
25 |
Correct |
2 ms |
428 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 |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
205 ms |
8492 KB |
Output is correct |
32 |
Correct |
266 ms |
8640 KB |
Output is correct |
33 |
Correct |
220 ms |
8508 KB |
Output is correct |
34 |
Correct |
207 ms |
8504 KB |
Output is correct |
35 |
Correct |
222 ms |
8508 KB |
Output is correct |
36 |
Correct |
205 ms |
8508 KB |
Output is correct |
37 |
Correct |
186 ms |
8536 KB |
Output is correct |
38 |
Correct |
172 ms |
8508 KB |
Output is correct |
39 |
Correct |
143 ms |
8508 KB |
Output is correct |
40 |
Correct |
205 ms |
8516 KB |
Output is correct |
41 |
Correct |
193 ms |
8516 KB |
Output is correct |
42 |
Correct |
233 ms |
8508 KB |
Output is correct |
43 |
Correct |
216 ms |
8516 KB |
Output is correct |
44 |
Correct |
222 ms |
8504 KB |
Output is correct |
45 |
Correct |
234 ms |
8504 KB |
Output is correct |
46 |
Correct |
214 ms |
8508 KB |
Output is correct |
47 |
Correct |
210 ms |
8524 KB |
Output is correct |
48 |
Correct |
180 ms |
8512 KB |
Output is correct |
49 |
Correct |
218 ms |
8516 KB |
Output is correct |
50 |
Correct |
204 ms |
8524 KB |
Output is correct |
51 |
Correct |
219 ms |
8508 KB |
Output is correct |
52 |
Correct |
216 ms |
8504 KB |
Output is correct |
53 |
Correct |
239 ms |
8504 KB |
Output is correct |
54 |
Correct |
218 ms |
8396 KB |
Output is correct |
55 |
Correct |
223 ms |
8400 KB |
Output is correct |
56 |
Correct |
194 ms |
8508 KB |
Output is correct |
57 |
Correct |
227 ms |
8508 KB |
Output is correct |
58 |
Correct |
192 ms |
8512 KB |
Output is correct |