#include <bits/stdc++.h>
#ifndef LOCAL
#define debug(...) 0
#else
#include "C:\programmingfunnyxd\debug.cpp"
#endif
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
void solve(){
int n, m; cin >> n >> m;
vector<int> a(n), b(m);
for(int& i: a) cin >> i;
for(int& i: b) cin >> i;
vector<int> dp(1 << m, -1), left(1 << m, -1);
// stores max prefix
dp[0] = left[0] = 0;
for(int j = 0; j < (1 << m); j++){
for(int i = 0; i < m; i++){
if(j & (1 << i)){
int without = j ^ (1 << i);
if(dp[without] == -1) continue;
int tot = left[without] + b[i];
if(tot == a[dp[without]]){
dp[j] = dp[without] + 1;
left[j] = 0;
}
else if(tot < a[dp[without]]){
dp[j] = dp[without];
left[j] = tot;
}
}
}
if(dp[j] == n){
puts("YES");
return;
}
}
puts("NO");
}
int main(){
cin.tie(0) -> sync_with_stdio(0);
int T = 1;
// cin >> T;
for(int _ = 0; _ < T; _++){
solve();
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
568 KB |
Output is correct |
| 5 |
Correct |
68 ms |
8532 KB |
Output is correct |
| 6 |
Correct |
1 ms |
324 KB |
Output is correct |
| 7 |
Correct |
1 ms |
324 KB |
Output is correct |
| 8 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 9 |
Correct |
83 ms |
8532 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
316 KB |
Output is correct |
| 5 |
Correct |
1 ms |
320 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
320 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 |
320 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
448 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
448 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
444 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
568 KB |
Output is correct |
| 5 |
Correct |
68 ms |
8532 KB |
Output is correct |
| 6 |
Correct |
1 ms |
324 KB |
Output is correct |
| 7 |
Correct |
1 ms |
324 KB |
Output is correct |
| 8 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 9 |
Correct |
83 ms |
8532 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
320 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
316 KB |
Output is correct |
| 14 |
Correct |
1 ms |
320 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
320 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 |
320 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 |
1 ms |
448 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
448 KB |
Output is correct |
| 26 |
Correct |
2 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
1 ms |
340 KB |
Output is correct |
| 29 |
Correct |
2 ms |
340 KB |
Output is correct |
| 30 |
Correct |
2 ms |
444 KB |
Output is correct |
| 31 |
Correct |
99 ms |
8524 KB |
Output is correct |
| 32 |
Correct |
112 ms |
8532 KB |
Output is correct |
| 33 |
Correct |
81 ms |
8532 KB |
Output is correct |
| 34 |
Correct |
82 ms |
8532 KB |
Output is correct |
| 35 |
Correct |
72 ms |
8532 KB |
Output is correct |
| 36 |
Correct |
75 ms |
8532 KB |
Output is correct |
| 37 |
Correct |
91 ms |
8532 KB |
Output is correct |
| 38 |
Correct |
69 ms |
8532 KB |
Output is correct |
| 39 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 40 |
Correct |
70 ms |
8528 KB |
Output is correct |
| 41 |
Correct |
69 ms |
8532 KB |
Output is correct |
| 42 |
Correct |
122 ms |
8532 KB |
Output is correct |
| 43 |
Correct |
72 ms |
8532 KB |
Output is correct |
| 44 |
Correct |
72 ms |
8512 KB |
Output is correct |
| 45 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 46 |
Correct |
94 ms |
8532 KB |
Output is correct |
| 47 |
Correct |
69 ms |
8532 KB |
Output is correct |
| 48 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 49 |
Correct |
69 ms |
8532 KB |
Output is correct |
| 50 |
Correct |
89 ms |
8532 KB |
Output is correct |
| 51 |
Correct |
72 ms |
8532 KB |
Output is correct |
| 52 |
Correct |
73 ms |
8532 KB |
Output is correct |
| 53 |
Correct |
102 ms |
8540 KB |
Output is correct |
| 54 |
Correct |
96 ms |
8532 KB |
Output is correct |
| 55 |
Correct |
87 ms |
8532 KB |
Output is correct |
| 56 |
Correct |
100 ms |
8532 KB |
Output is correct |
| 57 |
Correct |
85 ms |
8532 KB |
Output is correct |
| 58 |
Correct |
88 ms |
8528 KB |
Output is correct |
