#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define MOD (ll) (1e9+7)
int main() {
ios_base::sync_with_stdio(false);
int n,m; cin>>n>>m;
vector<int> people(n);
for(int i=0; i<n; i++) cin>>people[i];
vector<int> banknotes(m);
for(int i=0; i<m; i++) cin>>banknotes[i];
vector<int> people_paid(1<<m,-1);
vector<int> leftover(1<<m, -1);
leftover[0]=0;
people_paid[0]=0;
for(int subset = 1; subset<(1<<m); subset++) {
for(int last = 0; last<m; last++) {
if(!(subset&(1<<last))) continue;
int prev = subset-(1<<last);
if(people_paid[prev]==-1) continue;
int money_left = leftover[prev] + banknotes[last];
int next_target = people[people_paid[prev]];
if(money_left<next_target) {
people_paid[subset] = people_paid[prev];
leftover[subset] = money_left;
} else if (money_left == next_target) {
people_paid[subset] = people_paid[prev] + 1;
leftover[subset] = 0;
} else {
// nothing, we dont wanna update anything and try to make amount of money for next person with other values
}
}
if(people_paid[subset] == n) {
cout<<"YES"<<endl; return 0;
}
}
cout<<"NO"<<endl; return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
55 ms |
8504 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
5 ms |
8524 KB |
Output is correct |
| 9 |
Correct |
107 ms |
8524 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 |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
2 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
440 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 |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
55 ms |
8504 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
5 ms |
8524 KB |
Output is correct |
| 9 |
Correct |
107 ms |
8524 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 |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
2 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
332 KB |
Output is correct |
| 28 |
Correct |
1 ms |
332 KB |
Output is correct |
| 29 |
Correct |
1 ms |
440 KB |
Output is correct |
| 30 |
Correct |
1 ms |
332 KB |
Output is correct |
| 31 |
Correct |
113 ms |
8528 KB |
Output is correct |
| 32 |
Correct |
118 ms |
8524 KB |
Output is correct |
| 33 |
Correct |
69 ms |
8524 KB |
Output is correct |
| 34 |
Correct |
61 ms |
8524 KB |
Output is correct |
| 35 |
Correct |
56 ms |
8524 KB |
Output is correct |
| 36 |
Correct |
61 ms |
8508 KB |
Output is correct |
| 37 |
Correct |
56 ms |
8524 KB |
Output is correct |
| 38 |
Correct |
56 ms |
8496 KB |
Output is correct |
| 39 |
Correct |
5 ms |
8524 KB |
Output is correct |
| 40 |
Correct |
57 ms |
8524 KB |
Output is correct |
| 41 |
Correct |
56 ms |
8524 KB |
Output is correct |
| 42 |
Correct |
130 ms |
8524 KB |
Output is correct |
| 43 |
Correct |
59 ms |
8440 KB |
Output is correct |
| 44 |
Correct |
55 ms |
8504 KB |
Output is correct |
| 45 |
Correct |
5 ms |
8524 KB |
Output is correct |
| 46 |
Correct |
94 ms |
8524 KB |
Output is correct |
| 47 |
Correct |
57 ms |
8532 KB |
Output is correct |
| 48 |
Correct |
7 ms |
8524 KB |
Output is correct |
| 49 |
Correct |
57 ms |
8524 KB |
Output is correct |
| 50 |
Correct |
108 ms |
8644 KB |
Output is correct |
| 51 |
Correct |
57 ms |
8524 KB |
Output is correct |
| 52 |
Correct |
61 ms |
8524 KB |
Output is correct |
| 53 |
Correct |
131 ms |
8524 KB |
Output is correct |
| 54 |
Correct |
122 ms |
8516 KB |
Output is correct |
| 55 |
Correct |
108 ms |
8524 KB |
Output is correct |
| 56 |
Correct |
108 ms |
8524 KB |
Output is correct |
| 57 |
Correct |
106 ms |
8524 KB |
Output is correct |
| 58 |
Correct |
112 ms |
8524 KB |
Output is correct |
