| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 590780 |
2022-07-06T11:02:46 Z |
Mazaalai |
Bank (IZhO14_bank) |
C++17 |
|
1 ms |
468 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
using VI = vector <int>;
using PII = pair <int, int>;
using sint = short int;
// const int N = 20;
// const int M = 1<<N;
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
sint n, m;
cin >> n >> m;
sint a[n], b[n];
PII dp[1<<n];
for (sint i = 0; i < n; i++) cin >> a[i];
for (sint i = 0; i < m; i++) cin >> b[i];
sort(a, a+n);
sort(b, b+m);
dp[0] = {0, 0};
bool done = 0;
for (int i = 1; i < (1<<m) && !done; i++) {
dp[i] = {0, 0};
for (sint j = 0; j < m; j++) {
if (!(i & (1<<j)) || dp[i].ff > dp[i^(1<<j)].ff) continue;
PII& tmp = dp[i^(1<<j)];
if (tmp.ff > dp[i].ff) dp[i] = tmp;
if (a[tmp.ff] >= b[j]+tmp.ss) dp[i].ss = max(dp[i].ss, b[j]+tmp.ss);
}
if (dp[i].ss == a[dp[i].ff]) dp[i] = {dp[i].ff+1, 0};
done |= dp[i].ff == n;
}
cout << (done ? "YES" : "NO") << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
