# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125631 | srvlt | 은행 (IZhO14_bank) | C++14 | 1082 ms | 5872 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 ll long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
using namespace std;
int n, m, a[20], b[20], dp[20][(1 << 20)], s[(1 << 20)];
vector <int> d[20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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 i = 0; i < (1 << m); i++) {
for (int j = 0; j < m; j++) {
if (i & (1 << j)) {
s[i] += b[j];
}
}
for (int j = 0; j < n; j++) {
if (s[i] == a[j]) {
d[j].pb(i);
}
}
}
for (int i = 0; i < n; i++) {
dp[i][0] = 1;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j < (1 << m); j++) {
for (int k = 0; k < d[i].size(); k++) {
if ((j & d[i][k]) == d[i][k]) {
if (i > 0) {
if (dp[i - 1][j ^ d[i][k]]) {
dp[i][j] = 1;
break;
}
} else {
dp[i][j] = 1;
break;
}
}
}
}
}
if (dp[n - 1][(1 << m) - 1]) {
cout<<"YES";
} else {
cout<<"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... |