#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef long long ll;
#define PB push_back
#define MP make_pair
#define FOR(i, x, y) for (int i = x; i < y ; i ++)
const int MAXN = 21;
ii dp[1 << MAXN]; // num of covered & left over
int main(){
int n, m;
cin >> n >> m;
vi a(n), b(m);
FOR(i, 0, n){
cin >> a[i];
}
FOR(i, 0, m){
cin >> b[i];
}
//sort(a.rbegin(), a.rend());
dp[0] = MP(0, 0);
FOR(s, 1, 1 << m){
dp[s] = MP(0, 0);
FOR(i, 0, m){
if ((s & (1 << i))== 0){
continue;
}
int prev = s- (1 << i);
int indx = dp[prev].first;
int left = dp[prev].second;
if (left + b[i] == a[indx]){
left = 0;
indx ++;
}
else if (b[i] == a[indx]){
indx ++;
}
else{
left += b[i];
}
dp[s] = max(dp[s], MP(indx, left));
}
if (dp[s].first == n){
cout << "YES\n";
return 0;
}
//cout << s << " : " << dp[s].first << ' ' << dp[s].second << '\n';
}
cout << "NO\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
76 ms |
8432 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
70 ms |
8396 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 |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 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 |
2 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 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 |
1 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 |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
76 ms |
8432 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
70 ms |
8396 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 |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 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 |
2 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 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 |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
2 ms |
340 KB |
Output is correct |
| 31 |
Correct |
89 ms |
8456 KB |
Output is correct |
| 32 |
Correct |
95 ms |
8524 KB |
Output is correct |
| 33 |
Correct |
89 ms |
8468 KB |
Output is correct |
| 34 |
Correct |
87 ms |
8400 KB |
Output is correct |
| 35 |
Correct |
82 ms |
8396 KB |
Output is correct |
| 36 |
Correct |
76 ms |
8456 KB |
Output is correct |
| 37 |
Correct |
80 ms |
8540 KB |
Output is correct |
| 38 |
Correct |
70 ms |
8396 KB |
Output is correct |
| 39 |
Correct |
0 ms |
212 KB |
Output is correct |
| 40 |
Correct |
77 ms |
8396 KB |
Output is correct |
| 41 |
Correct |
75 ms |
8484 KB |
Output is correct |
| 42 |
Correct |
103 ms |
8376 KB |
Output is correct |
| 43 |
Correct |
84 ms |
8396 KB |
Output is correct |
| 44 |
Correct |
71 ms |
8388 KB |
Output is correct |
| 45 |
Correct |
1 ms |
212 KB |
Output is correct |
| 46 |
Correct |
97 ms |
8460 KB |
Output is correct |
| 47 |
Correct |
76 ms |
8596 KB |
Output is correct |
| 48 |
Correct |
0 ms |
212 KB |
Output is correct |
| 49 |
Correct |
73 ms |
8428 KB |
Output is correct |
| 50 |
Correct |
82 ms |
8396 KB |
Output is correct |
| 51 |
Correct |
87 ms |
8544 KB |
Output is correct |
| 52 |
Correct |
80 ms |
8444 KB |
Output is correct |
| 53 |
Correct |
94 ms |
8396 KB |
Output is correct |
| 54 |
Correct |
94 ms |
8460 KB |
Output is correct |
| 55 |
Correct |
85 ms |
8396 KB |
Output is correct |
| 56 |
Correct |
87 ms |
8444 KB |
Output is correct |
| 57 |
Correct |
81 ms |
8424 KB |
Output is correct |
| 58 |
Correct |
81 ms |
8396 KB |
Output is correct |
