# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468123 | TruaShamu | Bank (IZhO14_bank) | C++17 | 86 ms | 7108 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.
#define _crt_secure_no_warnings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
void fastio() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
}
int N, M;
int A[21];
int B[21];
vi sum[20001];
vi dp[21];
int main() {
fastio();
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 mask = 0; mask < (1 << M); ++mask) {
int cur = 0;
for (int i = 0; i < M; ++i) {
if ((mask & (1 << i)) > 0) {
cur += B[i];
}
}
sum[cur].pb(mask);
}
dp[0].pb(0);
bool f = false;
for (int i = 0; i < N; ++i) {
bool vis = new bool[1 << 21];
f = false;
for (int mask : sum[A[i]]) {
for (int pmask : dp[i]) {
int maskUnion = mask | pmask;
if ((mask & pmask) <= 0 && !vis[&maskUnion]) {
vis[&maskUnion] = true;
dp[i + 1].pb(mask | pmask);
f = true;
}
}
}
}
cout << (f ? "YES" : "NO")<< "\n";
}
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... |