#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long
void solve() {
// covered[mask] = max prefix of people that we can pay
// leftover[mask] = amount of money left over after we pay off the people
int n, m; cin >> n >> m;
vector<int> covered(1 << m, 0), leftover(1 << m, 0);
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int subset = 1; subset < (1 << m); subset++) {
for (int bit = 0; bit < m; bit++) {
if (subset & (1 << bit)) {
int prev = subset ^ (1 << bit);
int next = covered[prev];
int left = leftover[prev];
if (next == n) continue;
if (a[next] == left + b[bit]) {
covered[subset] = max(covered[subset], next + 1);
if (covered[subset] == next + 1) {
leftover[subset] = 0;
}
} else {
covered[subset] = max(covered[subset], next);
if (covered[subset] == next) leftover[subset] = left + b[bit];
}
}
}
}
for (int subset = 1; subset < (1 << m); subset++) {
if (covered[subset] == n) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
int main() {
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
// cin >> T;
while (T--)
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
79 ms |
8532 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
109 ms |
8532 KB |
Output is correct |
9 |
Correct |
80 ms |
8532 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 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 |
1 ms |
324 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
316 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 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 |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
448 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 |
1 ms |
444 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
79 ms |
8532 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
109 ms |
8532 KB |
Output is correct |
9 |
Correct |
80 ms |
8532 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 |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
324 KB |
Output is correct |
15 |
Correct |
1 ms |
316 KB |
Output is correct |
16 |
Correct |
1 ms |
316 KB |
Output is correct |
17 |
Correct |
1 ms |
212 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 |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
448 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 |
1 ms |
444 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
93 ms |
8504 KB |
Output is correct |
32 |
Correct |
100 ms |
8532 KB |
Output is correct |
33 |
Correct |
95 ms |
8532 KB |
Output is correct |
34 |
Correct |
88 ms |
8532 KB |
Output is correct |
35 |
Correct |
87 ms |
8532 KB |
Output is correct |
36 |
Correct |
80 ms |
8532 KB |
Output is correct |
37 |
Correct |
89 ms |
8532 KB |
Output is correct |
38 |
Correct |
102 ms |
8532 KB |
Output is correct |
39 |
Correct |
100 ms |
8508 KB |
Output is correct |
40 |
Correct |
85 ms |
8528 KB |
Output is correct |
41 |
Correct |
78 ms |
8532 KB |
Output is correct |
42 |
Correct |
111 ms |
8536 KB |
Output is correct |
43 |
Correct |
91 ms |
8512 KB |
Output is correct |
44 |
Correct |
89 ms |
8540 KB |
Output is correct |
45 |
Correct |
104 ms |
8532 KB |
Output is correct |
46 |
Correct |
102 ms |
8524 KB |
Output is correct |
47 |
Correct |
93 ms |
8532 KB |
Output is correct |
48 |
Correct |
88 ms |
8532 KB |
Output is correct |
49 |
Correct |
88 ms |
8528 KB |
Output is correct |
50 |
Correct |
83 ms |
8532 KB |
Output is correct |
51 |
Correct |
92 ms |
8532 KB |
Output is correct |
52 |
Correct |
80 ms |
8532 KB |
Output is correct |
53 |
Correct |
113 ms |
8532 KB |
Output is correct |
54 |
Correct |
100 ms |
8532 KB |
Output is correct |
55 |
Correct |
85 ms |
8532 KB |
Output is correct |
56 |
Correct |
83 ms |
8532 KB |
Output is correct |
57 |
Correct |
82 ms |
8532 KB |
Output is correct |
58 |
Correct |
84 ms |
8532 KB |
Output is correct |