//Day 1 Problem B: bank
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n, m, a[20], b[20];
pair<int, int> dp[1<<20]; // <i, j> = <done with first i people, payed (i+1)th person j>
bool pos=0;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i=0; i<n; ++i) cin >> a[i];
for (int i=0; i<m; ++i) cin >> b[i];
for (int i=1; i<(1<<m); ++i) dp[i].first=-1;
for (int mask=0; mask<(1<<m); ++mask) {
if (dp[mask]==make_pair(n, 0)) {
pos=1;
break;
}
if (dp[mask].first==-1) continue;
int ind=dp[mask].first, payed=dp[mask].second; //index of person we are on (0-indexed), amount we have already payed
assert(ind<n&&payed<a[ind]);
for (int i=0; i<m; ++i) if (!(mask&(1<<i))) {
if (payed+b[i]>a[ind]) continue;
if (payed+b[i]==a[ind]) dp[mask|(1<<i)]={ind+1, 0};
else dp[mask|(1<<i)]={ind, payed+b[i]};
}
}
cout << (pos?"YES":"NO");
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
640 KB |
Output is correct |
| 5 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 9 |
Correct |
79 ms |
8576 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Correct |
1 ms |
512 KB |
Output is correct |
| 3 |
Correct |
1 ms |
512 KB |
Output is correct |
| 4 |
Correct |
1 ms |
512 KB |
Output is correct |
| 5 |
Correct |
1 ms |
512 KB |
Output is correct |
| 6 |
Correct |
1 ms |
512 KB |
Output is correct |
| 7 |
Correct |
1 ms |
512 KB |
Output is correct |
| 8 |
Correct |
1 ms |
512 KB |
Output is correct |
| 9 |
Correct |
1 ms |
512 KB |
Output is correct |
| 10 |
Correct |
1 ms |
512 KB |
Output is correct |
| 11 |
Correct |
1 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
640 KB |
Output is correct |
| 5 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 9 |
Correct |
79 ms |
8576 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
0 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
0 ms |
384 KB |
Output is correct |
| 18 |
Correct |
0 ms |
384 KB |
Output is correct |
| 19 |
Correct |
0 ms |
384 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
1 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
1 ms |
512 KB |
Output is correct |
| 27 |
Correct |
1 ms |
512 KB |
Output is correct |
| 28 |
Correct |
1 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
512 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
71 ms |
8592 KB |
Output is correct |
| 32 |
Correct |
85 ms |
8576 KB |
Output is correct |
| 33 |
Correct |
12 ms |
8576 KB |
Output is correct |
| 34 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 35 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 36 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 37 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 38 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 39 |
Correct |
7 ms |
8576 KB |
Output is correct |
| 40 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 41 |
Correct |
7 ms |
8576 KB |
Output is correct |
| 42 |
Correct |
53 ms |
8576 KB |
Output is correct |
| 43 |
Correct |
7 ms |
8576 KB |
Output is correct |
| 44 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 45 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 46 |
Correct |
26 ms |
8576 KB |
Output is correct |
| 47 |
Correct |
6 ms |
8576 KB |
Output is correct |
| 48 |
Correct |
5 ms |
8576 KB |
Output is correct |
| 49 |
Correct |
7 ms |
8576 KB |
Output is correct |
| 50 |
Correct |
75 ms |
8576 KB |
Output is correct |
| 51 |
Correct |
9 ms |
8576 KB |
Output is correct |
| 52 |
Correct |
14 ms |
8576 KB |
Output is correct |
| 53 |
Correct |
94 ms |
8576 KB |
Output is correct |
| 54 |
Correct |
83 ms |
8576 KB |
Output is correct |
| 55 |
Correct |
77 ms |
8696 KB |
Output is correct |
| 56 |
Correct |
82 ms |
8576 KB |
Output is correct |
| 57 |
Correct |
81 ms |
8576 KB |
Output is correct |
| 58 |
Correct |
80 ms |
8576 KB |
Output is correct |
