# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1262351 | longsaumui | Bank (IZhO14_bank) | C++20 | 130 ms | 8520 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
if (fopen("task.inp" , "r")) {
freopen("task.inp" , "r" , stdin);
freopen("task.out" , "w" , stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n, m;cin >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
vector<pair<int, int>> dp(1 << m);
for (int s = 0; s < (1 << m); s++) {
for (int i = 0; i < m; i++) {
if (s & (1 << i)) continue;
auto [id, x] = dp[s];
int j = s | (1 << i);
if (id == n) {
cout << "YES" << '\n';
return 0;
}
pair<int, int> cur;
if (x + b[i] == a[id]) {
cur = {id + 1, 0};
if (id + 1 == n) {
cout << "YES" << '\n';
return 0;
}
}
else if (x + b[i] < a[id]) {
cur = {id, b[i] + x};
}
dp[j] = max(dp[j], cur);
}
}
cout << "NO" << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |