| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 640819 | phoenix | Bank (IZhO14_bank) | C++17 | 2 ms | 340 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>
using namespace std;
const int N = 20; const int M = 14;
int n, m;
int a[ N ], b[ M ];
int w[(1 << M)], dp[(1 << M)];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
freopen("bank.in", "r", stdin);
freopen("bank.out", "w", stdout);
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 msk = 1;msk < (1 << m);msk++)
for(int i = 0;i < m;i++)
if(msk & (1 << i))
w[ msk ] += b[ i ];
for(int msk = 1;msk < (1 << m);msk++) {
for(int m = msk;m > 0;m = msk & (m - 1)) {
dp[ msk ] = max(dp[ msk ], dp[(msk ^ m)] + (w[ m ] == a[ dp[(msk ^ m)] ]));
}
}
cout << (dp[ (1 << m) - 1 ] == n ? "YES\n" : "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... | ||||
