| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 887696 | duckindog | Bank (IZhO14_bank) | C++14 | 267 ms | 440 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.
//from duckindog wth depression
#include<bits/stdc++.h>
using namespace std;
const int N = 21,
M = (1 << 20);
int a[N], b[N];
int f[M];
int32_t main() {
cin.tie()->sync_with_stdio(0);
if (fopen("duck.inp", "r")) {
freopen("duck.inp", "r", stdin);
freopen("duck.out", "w", stdout);
}
int n, m; cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
for (int mask = 1; mask <= (1 << m) - 1; ++mask) {
for (int s = 0; s < mask; ++s) {
if (f[s] == n) continue;
if ((s | mask) != mask) continue;
int t = ((s & mask) ^ mask);
int val = 0;
for (int i = 1; i <= m; ++i) if ((t >> i - 1) & i) val += b[i];
if (val == a[f[s] + 1]) f[mask] = max(f[mask], f[s] + 1);
}
}
for (int mask = 1; mask <= (1 << m) - 1; ++mask) {
if (f[mask] == n) {
cout << "YES";
return 0;
}
}
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... | ||||
