#include <bits/stdc++.h>
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define fi first
#define se second
using namespace std;
const int N = 22;
const int oo = 1e9;
int n, m;
int a[N], b[N];
pair <int, long long> f[MASK(N)];
int main(){
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
for (int i = 0; i < MASK(m); i++)
f[i] = {-oo, 0};
f[0] = {0, 0};
for (int i = 0; i < MASK(m); i++){
for (int j = 1; j <= m; j++){
// cout << i << ' ' << j << '\n';
int mask = BIT(i, j - 1);
if (mask) continue;
mask = (i | MASK(j - 1));
// if (i == 10 && j == 3) cout << f[mask].fi << ' ' << f[mask].se << '\n';
if (f[mask].fi < f[i].fi){
f[mask].fi = f[i].fi;
f[mask].se = f[i].se + b[j];
}
if (f[mask].se == a[f[mask].fi + 1] && f[mask].fi + 1 <= n){
f[mask].se = 0;
f[mask].fi++;
}
}
}
for (int i = 0; i < MASK(m); i++){
// cout << f[i].fi << ' ' << f[i].se << ' ' << i << '\n';
if (f[i].fi == n) return cout << "YES", 0;
}
cout << "NO";
}
//toi chep code :((((
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
216 KB |
Output is correct |
4 |
Correct |
3 ms |
820 KB |
Output is correct |
5 |
Correct |
86 ms |
16704 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
88 ms |
16720 KB |
Output is correct |
9 |
Correct |
82 ms |
16704 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
308 KB |
Output is correct |
2 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
312 KB |
Output is correct |
8 |
Correct |
1 ms |
224 KB |
Output is correct |
9 |
Correct |
1 ms |
320 KB |
Output is correct |
10 |
Correct |
1 ms |
224 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
560 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
2 ms |
548 KB |
Output is correct |
8 |
Correct |
2 ms |
468 KB |
Output is correct |
9 |
Correct |
2 ms |
468 KB |
Output is correct |
10 |
Correct |
2 ms |
468 KB |
Output is correct |
11 |
Correct |
2 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
216 KB |
Output is correct |
4 |
Correct |
3 ms |
820 KB |
Output is correct |
5 |
Correct |
86 ms |
16704 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
88 ms |
16720 KB |
Output is correct |
9 |
Correct |
82 ms |
16704 KB |
Output is correct |
10 |
Correct |
1 ms |
308 KB |
Output is correct |
11 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
312 KB |
Output is correct |
17 |
Correct |
1 ms |
224 KB |
Output is correct |
18 |
Correct |
1 ms |
320 KB |
Output is correct |
19 |
Correct |
1 ms |
224 KB |
Output is correct |
20 |
Correct |
2 ms |
560 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
2 ms |
468 KB |
Output is correct |
23 |
Correct |
2 ms |
468 KB |
Output is correct |
24 |
Correct |
2 ms |
468 KB |
Output is correct |
25 |
Correct |
2 ms |
468 KB |
Output is correct |
26 |
Correct |
2 ms |
548 KB |
Output is correct |
27 |
Correct |
2 ms |
468 KB |
Output is correct |
28 |
Correct |
2 ms |
468 KB |
Output is correct |
29 |
Correct |
2 ms |
468 KB |
Output is correct |
30 |
Correct |
2 ms |
468 KB |
Output is correct |
31 |
Correct |
90 ms |
16704 KB |
Output is correct |
32 |
Correct |
91 ms |
16704 KB |
Output is correct |
33 |
Correct |
86 ms |
16700 KB |
Output is correct |
34 |
Correct |
83 ms |
16664 KB |
Output is correct |
35 |
Correct |
92 ms |
16704 KB |
Output is correct |
36 |
Correct |
87 ms |
16632 KB |
Output is correct |
37 |
Correct |
91 ms |
16700 KB |
Output is correct |
38 |
Correct |
95 ms |
16704 KB |
Output is correct |
39 |
Correct |
89 ms |
16700 KB |
Output is correct |
40 |
Correct |
84 ms |
16596 KB |
Output is correct |
41 |
Correct |
82 ms |
16704 KB |
Output is correct |
42 |
Correct |
87 ms |
16708 KB |
Output is correct |
43 |
Correct |
96 ms |
16720 KB |
Output is correct |
44 |
Correct |
107 ms |
16704 KB |
Output is correct |
45 |
Correct |
87 ms |
16724 KB |
Output is correct |
46 |
Correct |
89 ms |
16704 KB |
Output is correct |
47 |
Correct |
84 ms |
16700 KB |
Output is correct |
48 |
Correct |
85 ms |
16700 KB |
Output is correct |
49 |
Correct |
83 ms |
16704 KB |
Output is correct |
50 |
Correct |
89 ms |
16700 KB |
Output is correct |
51 |
Correct |
78 ms |
16704 KB |
Output is correct |
52 |
Correct |
77 ms |
16704 KB |
Output is correct |
53 |
Correct |
77 ms |
16724 KB |
Output is correct |
54 |
Correct |
78 ms |
16708 KB |
Output is correct |
55 |
Correct |
76 ms |
16704 KB |
Output is correct |
56 |
Correct |
78 ms |
16704 KB |
Output is correct |
57 |
Correct |
76 ms |
16708 KB |
Output is correct |
58 |
Correct |
77 ms |
16724 KB |
Output is correct |