# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831046 | NoLove | Bank (IZhO14_bank) | C++14 | 1085 ms | 596 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.
/**
* author : Lăng Trọng Đạt
* created: 2023-08-19
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int int64_t
using pii = pair<int, int>;
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("hi.inp", "r")) {
freopen("hi.inp", "r", stdin);
freopen("hi.out", "w", stderr);
}
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (auto& i : a) cin >> i;
for (auto& i : b) cin >> i;
sort(a.begin(), a.end());
// dp[i][mask] = true neu nhu i nguoi dau tien co the nhan du luong
vector<vector<bool>> dp(n, vector<bool>(1 << m, 0));
map<int, vector<int>> mp; // {val, mask}
for (int mask = 1; mask < (1 << m); mask++) {
int total = 0;
for (int j = 0; j < m; j++)
if ((1 << j) & mask)
total += b[j];
if (binary_search(a.begin(), a.end(), total))
mp[total].push_back(mask);
}
for (int i = 0; i < n; i++) {
for (int mask = 1; mask < (1 << m); mask++) {
for (int mask2 : mp[a[i]]) {
for (int i = 0; i < m; i++) {
if (((1 << i) & mask2) and !((1 << i) & mask)) goto cnt;
}
if (i == 0 or dp[i - 1][mask ^ mask2]) {
dp[i][mask] = true;
break;
}
cnt:;
}
}
}
cout << (dp[n - 1][(1 << m) - 1] ? "YES\n" : "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... |