# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927058 | May27_th | Bank (IZhO14_bank) | C++17 | 1061 ms | 15308 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define taskname "bank"
using namespace std;
void World_Final();
void Solve();
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
World_Final();
}
void World_Final(){
int Tests = 1;
//cin >> Tests;
while (Tests --) {
Solve();
}
}
void Solve(){
int N, M; cin >> N >> M;
vector<int> a(N), b(M);
vector<vector<bool>> f(N + 5, vector<bool>((1 << M) + 5, false));
for (int &x : a) cin >> x;
for (int &x : b) cin >> x;
vector<vector<int>> mp (200005); mp[0].push_back(0);
for (int mask = 0; mask < (1 << M); mask ++) {
int sum = 0;
for (int i = 0; i < M; i ++) {
if (mask >> i & 1) sum = sum + b[i];
}
mp[sum].push_back(mask);
}
int tot = 0;
f[0][0] = true;
bool ans = false;
for (int i = 0; i < N; i ++) {
tot = tot + a[i];
for (int mask : mp[tot]) {
for (int prev : mp[tot - a[i]]) {
if ((mask & prev) == prev) {
//cout << mask << " " << prev << "\n";
f[i + 1][mask] = max(f[i + 1][mask], f[i][prev]);
}
}
if (i == N - 1) ans |= f[N][mask];
}
}
cout << (ans ? "YES" : "NO");
}
/**
**/
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... |