#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define mp make_pair
#define F first
#define S second
constexpr int maxn = 20;
int n, m;
int a[maxn];
int b[maxn];
pii note[1 << maxn]; // (can pay 1...k, leftover l)
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
bool ans = false;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int notes = 0; notes < (1 << m); notes++) {
if (notes == 0) {
note[notes] = mp(-1, 0);
continue;
}
pii ansp = mp(-1, 0);
for (int i = 0; i < m; i++) {
if (!(notes & (1 << i))) continue;
int prevnote = notes - (1 << i);
int k = -1, l = -1;
if (note[prevnote].S + b[i] == a[note[prevnote].F + 1]) {
k = note[prevnote].F + 1;
l = 0;
} else {
k = note[prevnote].F;
l = note[prevnote].S + b[i];
}
// if (k > ansp.F) ansp = mp(k, l);
ansp = max(ansp, mp(k, l));
}
note[notes] = ansp;
// cout << bitset<5>(notes).to_string() << " : " << note[notes].F << '\t' << note[notes].S <<
// '\n';
if (ansp.F == n - 1) {
ans = true;
break;
}
}
cout << (ans ? "YES\n" : "NO\n");
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 |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
77 ms |
8464 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
82 ms |
8456 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 |
0 ms |
308 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
316 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 |
308 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
444 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
1 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 |
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 |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
77 ms |
8464 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
82 ms |
8456 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
308 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
316 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 |
308 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 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 |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
444 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
1 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 |
85 ms |
8380 KB |
Output is correct |
32 |
Correct |
96 ms |
8384 KB |
Output is correct |
33 |
Correct |
93 ms |
8476 KB |
Output is correct |
34 |
Correct |
83 ms |
8488 KB |
Output is correct |
35 |
Correct |
83 ms |
8456 KB |
Output is correct |
36 |
Correct |
77 ms |
8496 KB |
Output is correct |
37 |
Correct |
79 ms |
8464 KB |
Output is correct |
38 |
Correct |
80 ms |
8464 KB |
Output is correct |
39 |
Correct |
1 ms |
212 KB |
Output is correct |
40 |
Correct |
78 ms |
8468 KB |
Output is correct |
41 |
Correct |
78 ms |
8528 KB |
Output is correct |
42 |
Correct |
103 ms |
8440 KB |
Output is correct |
43 |
Correct |
85 ms |
8452 KB |
Output is correct |
44 |
Correct |
77 ms |
8500 KB |
Output is correct |
45 |
Correct |
1 ms |
340 KB |
Output is correct |
46 |
Correct |
95 ms |
8468 KB |
Output is correct |
47 |
Correct |
77 ms |
8420 KB |
Output is correct |
48 |
Correct |
0 ms |
212 KB |
Output is correct |
49 |
Correct |
76 ms |
8396 KB |
Output is correct |
50 |
Correct |
77 ms |
8452 KB |
Output is correct |
51 |
Correct |
86 ms |
8520 KB |
Output is correct |
52 |
Correct |
76 ms |
8400 KB |
Output is correct |
53 |
Correct |
101 ms |
8476 KB |
Output is correct |
54 |
Correct |
92 ms |
8444 KB |
Output is correct |
55 |
Correct |
77 ms |
8472 KB |
Output is correct |
56 |
Correct |
90 ms |
8392 KB |
Output is correct |
57 |
Correct |
87 ms |
8492 KB |
Output is correct |
58 |
Correct |
83 ms |
8504 KB |
Output is correct |