#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 21;
int n, m, a[30], b[30], p[30], sum;
pair <int, int> dp[N];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i], sum -= a[i];
for (int i = 0; i < m; i++)
cin >> b[i], sum += b[i];
if (sum < 0)
return cout << "NO\n", 0;
if (sum > 0)
a[n] = sum, n++;
p[0] = a[0];
for (int i = 1; i < n; i++)
p[i] = p[i - 1] + a[i];
cout << '\n';
for (int mask = 0; mask < (1 << m); mask++)
if (dp[mask].first || !mask) {
for (int j = 0; j < m; j++)
if (!((mask >> j) & 1)) {
if (dp[mask].first + b[j] == p[dp[mask].second])
dp[mask ^ (1 << j)] = {dp[mask].first + b[j], dp[mask].second + 1};
else if (dp[mask].first + b[j] < p[dp[mask].second])
dp[mask ^ (1 << j)] = {dp[mask].first + b[j], dp[mask].second};
if (dp[mask ^ (1 << j)].second == n)
return cout << "YES\n", 0;
}
}
cout << "NO\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
1 ms |
292 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
47 ms |
8472 KB |
Output is correct |
9 |
Correct |
96 ms |
8388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
1 ms |
292 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
47 ms |
8472 KB |
Output is correct |
9 |
Correct |
96 ms |
8388 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
1 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
204 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
25 |
Correct |
1 ms |
204 KB |
Output is correct |
26 |
Correct |
1 ms |
332 KB |
Output is correct |
27 |
Correct |
1 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
336 KB |
Output is correct |
29 |
Correct |
1 ms |
336 KB |
Output is correct |
30 |
Correct |
1 ms |
204 KB |
Output is correct |
31 |
Correct |
49 ms |
8388 KB |
Output is correct |
32 |
Correct |
51 ms |
8456 KB |
Output is correct |
33 |
Correct |
10 ms |
6860 KB |
Output is correct |
34 |
Correct |
2 ms |
972 KB |
Output is correct |
35 |
Correct |
3 ms |
1740 KB |
Output is correct |
36 |
Correct |
3 ms |
588 KB |
Output is correct |
37 |
Correct |
3 ms |
844 KB |
Output is correct |
38 |
Correct |
2 ms |
304 KB |
Output is correct |
39 |
Correct |
48 ms |
8480 KB |
Output is correct |
40 |
Correct |
2 ms |
332 KB |
Output is correct |
41 |
Correct |
1 ms |
204 KB |
Output is correct |
42 |
Correct |
58 ms |
8448 KB |
Output is correct |
43 |
Correct |
6 ms |
4172 KB |
Output is correct |
44 |
Correct |
2 ms |
332 KB |
Output is correct |
45 |
Correct |
34 ms |
8428 KB |
Output is correct |
46 |
Correct |
13 ms |
8268 KB |
Output is correct |
47 |
Correct |
3 ms |
592 KB |
Output is correct |
48 |
Correct |
43 ms |
8464 KB |
Output is correct |
49 |
Correct |
3 ms |
332 KB |
Output is correct |
50 |
Correct |
44 ms |
8404 KB |
Output is correct |
51 |
Correct |
3 ms |
848 KB |
Output is correct |
52 |
Correct |
7 ms |
8368 KB |
Output is correct |
53 |
Correct |
53 ms |
8392 KB |
Output is correct |
54 |
Correct |
49 ms |
8376 KB |
Output is correct |
55 |
Correct |
45 ms |
8420 KB |
Output is correct |
56 |
Correct |
44 ms |
8492 KB |
Output is correct |
57 |
Correct |
1 ms |
204 KB |
Output is correct |
58 |
Correct |
44 ms |
8520 KB |
Output is correct |