#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
const int MAXN = 20;
int n, m;
bool valid[1 << MAXN];
int notes[MAXN], sal[MAXN];
pair<int, int> dp[1 << MAXN];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> sal[i];
for(int i = 0; i < m; i++) cin >> notes[i];
// fill(dp, dp + (1 << n), make_pair(1e9, 1e9));
dp[0] = make_pair(0, 0);
valid[0] = true;
for(int i = 0; i < (1 << m); i++){
for(int j = 0; j < m; j++){
if(i & (1 << j)){
if(!valid[i ^ (1 << j)]) continue;
pair<int, int> curr = dp[i ^ (1 << j)];
if(curr.first < n && curr.second + notes[j] < sal[curr.first]){
curr.second += notes[j];
dp[i] = curr;
valid[i] = true;
}
else if(curr.first < n && curr.second + notes[j] == sal[curr.first]){
curr.first++;
curr.second = 0;
dp[i] = curr;
valid[i] = true;
}
}
}
if(valid[i] && dp[i].first >= n){
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
0 ms |
2396 KB |
Output is correct |
5 |
Correct |
71 ms |
4444 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
71 ms |
9492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2392 KB |
Output is correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
1 ms |
2392 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
2 ms |
2392 KB |
Output is correct |
3 |
Correct |
2 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Correct |
2 ms |
2392 KB |
Output is correct |
7 |
Correct |
2 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
2 ms |
2904 KB |
Output is correct |
10 |
Correct |
2 ms |
2392 KB |
Output is correct |
11 |
Correct |
2 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
0 ms |
2396 KB |
Output is correct |
5 |
Correct |
71 ms |
4444 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
71 ms |
9492 KB |
Output is correct |
10 |
Correct |
1 ms |
2392 KB |
Output is correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
1 ms |
2392 KB |
Output is correct |
13 |
Correct |
1 ms |
2396 KB |
Output is correct |
14 |
Correct |
1 ms |
2392 KB |
Output is correct |
15 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Correct |
1 ms |
2396 KB |
Output is correct |
17 |
Correct |
1 ms |
2392 KB |
Output is correct |
18 |
Correct |
1 ms |
2392 KB |
Output is correct |
19 |
Correct |
1 ms |
2396 KB |
Output is correct |
20 |
Correct |
1 ms |
2392 KB |
Output is correct |
21 |
Correct |
2 ms |
2392 KB |
Output is correct |
22 |
Correct |
2 ms |
2396 KB |
Output is correct |
23 |
Correct |
1 ms |
2396 KB |
Output is correct |
24 |
Correct |
1 ms |
2392 KB |
Output is correct |
25 |
Correct |
2 ms |
2392 KB |
Output is correct |
26 |
Correct |
2 ms |
2392 KB |
Output is correct |
27 |
Correct |
1 ms |
2392 KB |
Output is correct |
28 |
Correct |
2 ms |
2904 KB |
Output is correct |
29 |
Correct |
2 ms |
2392 KB |
Output is correct |
30 |
Correct |
2 ms |
2392 KB |
Output is correct |
31 |
Correct |
80 ms |
9636 KB |
Output is correct |
32 |
Correct |
82 ms |
9640 KB |
Output is correct |
33 |
Correct |
75 ms |
9556 KB |
Output is correct |
34 |
Correct |
75 ms |
9056 KB |
Output is correct |
35 |
Correct |
71 ms |
9040 KB |
Output is correct |
36 |
Correct |
72 ms |
8784 KB |
Output is correct |
37 |
Correct |
71 ms |
8784 KB |
Output is correct |
38 |
Correct |
71 ms |
4432 KB |
Output is correct |
39 |
Correct |
0 ms |
2392 KB |
Output is correct |
40 |
Correct |
71 ms |
8528 KB |
Output is correct |
41 |
Correct |
72 ms |
8528 KB |
Output is correct |
42 |
Correct |
95 ms |
9608 KB |
Output is correct |
43 |
Correct |
78 ms |
9452 KB |
Output is correct |
44 |
Correct |
72 ms |
6616 KB |
Output is correct |
45 |
Correct |
1 ms |
2392 KB |
Output is correct |
46 |
Correct |
84 ms |
9552 KB |
Output is correct |
47 |
Correct |
71 ms |
8784 KB |
Output is correct |
48 |
Correct |
1 ms |
2392 KB |
Output is correct |
49 |
Correct |
71 ms |
8528 KB |
Output is correct |
50 |
Correct |
77 ms |
9432 KB |
Output is correct |
51 |
Correct |
78 ms |
8800 KB |
Output is correct |
52 |
Correct |
71 ms |
9552 KB |
Output is correct |
53 |
Correct |
87 ms |
9552 KB |
Output is correct |
54 |
Correct |
85 ms |
9552 KB |
Output is correct |
55 |
Correct |
79 ms |
9600 KB |
Output is correct |
56 |
Correct |
80 ms |
9552 KB |
Output is correct |
57 |
Correct |
78 ms |
9552 KB |
Output is correct |
58 |
Correct |
78 ms |
9660 KB |
Output is correct |