#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,l,r) for(int i = (l); i < r; i++)
#define per(i,r,l) for(int i = (r); i >= l; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define ss second
const ll mod = 1e9 + 7, maxn = 20, inf = 1e9 + 5;
int a[maxn], c[maxn];
pair<int, int> dp[1 << maxn];
int main(){
int n, m; cin >> n >> m;
rep(i,0,n) cin >> a[i];
rep(i,0,m) cin >> c[i];
dp[0] = {0, 0};
rep(b, 1, 1 << m){
rep(i,0,m){
pair<int, int> df;
if((b & (1 << i)) && dp[b ^ (1 << i)].ff != -1){
int t = a[dp[(b ^ (1 << i))].ff] - dp[(b^(1 << i))].ss;
if(t < c[i]) continue;
dp[b] = dp[(b ^ (1 << i))];
if(t == c[i]){
dp[b].ff++;
dp[b].ss = 0;
if(dp[b].ff == n) return cout << "YES\n", 0;
}else{
dp[b].ss += c[i];
}
break;
}
dp[b].ff = -1;
}
}
// rep(i,0,1 << m){
// rep(j,0,m) cout << (i & (1 << j) ? 1 : 0);
// cout << ' ' << i << ' ' << dp[i].ff << ' ' << dp[i].ss << '\n';
// }
cout << "NO\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
77 ms |
8396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
8 ms |
8396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
332 KB |
Output is correct |
| 2 |
Correct |
2 ms |
332 KB |
Output is correct |
| 3 |
Correct |
2 ms |
332 KB |
Output is correct |
| 4 |
Correct |
2 ms |
332 KB |
Output is correct |
| 5 |
Correct |
2 ms |
432 KB |
Output is correct |
| 6 |
Correct |
2 ms |
428 KB |
Output is correct |
| 7 |
Correct |
2 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
300 KB |
Output is correct |
| 9 |
Correct |
2 ms |
332 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
77 ms |
8396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
8 ms |
8396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
2 ms |
332 KB |
Output is correct |
| 21 |
Correct |
2 ms |
332 KB |
Output is correct |
| 22 |
Correct |
2 ms |
332 KB |
Output is correct |
| 23 |
Correct |
2 ms |
332 KB |
Output is correct |
| 24 |
Correct |
2 ms |
432 KB |
Output is correct |
| 25 |
Correct |
2 ms |
428 KB |
Output is correct |
| 26 |
Correct |
2 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
300 KB |
Output is correct |
| 28 |
Correct |
2 ms |
332 KB |
Output is correct |
| 29 |
Correct |
2 ms |
332 KB |
Output is correct |
| 30 |
Correct |
1 ms |
332 KB |
Output is correct |
| 31 |
Correct |
26 ms |
8388 KB |
Output is correct |
| 32 |
Correct |
16 ms |
8460 KB |
Output is correct |
| 33 |
Correct |
82 ms |
8456 KB |
Output is correct |
| 34 |
Correct |
80 ms |
8364 KB |
Output is correct |
| 35 |
Correct |
90 ms |
8388 KB |
Output is correct |
| 36 |
Correct |
81 ms |
8492 KB |
Output is correct |
| 37 |
Correct |
77 ms |
8364 KB |
Output is correct |
| 38 |
Correct |
79 ms |
8388 KB |
Output is correct |
| 39 |
Correct |
1 ms |
204 KB |
Output is correct |
| 40 |
Correct |
79 ms |
8472 KB |
Output is correct |
| 41 |
Correct |
81 ms |
8388 KB |
Output is correct |
| 42 |
Correct |
65 ms |
8440 KB |
Output is correct |
| 43 |
Correct |
82 ms |
8480 KB |
Output is correct |
| 44 |
Correct |
89 ms |
8400 KB |
Output is correct |
| 45 |
Correct |
1 ms |
332 KB |
Output is correct |
| 46 |
Correct |
80 ms |
8384 KB |
Output is correct |
| 47 |
Correct |
78 ms |
8480 KB |
Output is correct |
| 48 |
Correct |
1 ms |
204 KB |
Output is correct |
| 49 |
Correct |
90 ms |
8484 KB |
Output is correct |
| 50 |
Correct |
26 ms |
8484 KB |
Output is correct |
| 51 |
Correct |
85 ms |
8380 KB |
Output is correct |
| 52 |
Correct |
76 ms |
8468 KB |
Output is correct |
| 53 |
Correct |
22 ms |
8444 KB |
Output is correct |
| 54 |
Correct |
21 ms |
8384 KB |
Output is correct |
| 55 |
Correct |
21 ms |
8396 KB |
Output is correct |
| 56 |
Correct |
15 ms |
8440 KB |
Output is correct |
| 57 |
Correct |
15 ms |
8424 KB |
Output is correct |
| 58 |
Correct |
18 ms |
8388 KB |
Output is correct |
