# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1244832 | Sang | Bank (IZhO14_bank) | C++20 | 1093 ms | 16456 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;
const int M = (1 << 20) + 5;
int dp_before[M],dp_cur[M],a[25],b[25],sum[M];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int n,m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int mask = 0; mask < (1 << m); mask++) {
sum[mask] = 0;
for (int i = 0; i < m; i++)
if (mask >> i & 1) sum[mask] += b[i];
}
for (int mask = 0; mask < (1 << m); mask++)
if (sum[mask] == a[1]) dp_before[mask] = 1;
for (int i = 2; i <= n; i++) {
for (int mask = 0; mask < (1 << m); mask++)
for (int sub = mask; sub > 0; sub = (sub - 1) & mask)
if (dp_before[mask ^ sub] && sum[sub] == a[i]) dp_cur[mask] = 1;
for (int mask = 0; mask < (1 << m); mask++) {
dp_before[mask] = dp_cur[mask];
dp_cur[mask] = 0;
}
}
for (int mask = 0; mask < (1 << m); mask++)
if (dp_before[mask]) {
cout << "YES\n";
return 0;
}
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... |