# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91107 | antimirage | Bank (IZhO14_bank) | C++14 | 1091 ms | 4600 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 fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 25;
int n, m, a[N], b[N], dp[N][1 << 16], sum[1 << 16];
main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i]);
for (int mask = 0; mask < (1 << m); mask++)
{
for (int j = 1; j <= m; j++)
{
if ( mask & (1 << (j - 1)) )
sum[mask] += b[j];
}
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
{
for (int mask1 = 0; mask1 < (1 << m); mask1++)
{
for (int mask2 = mask1; mask2 > 0; mask2 = ( (mask2 - 1) & mask1) )
{
if ( dp[i - 1][mask1 - mask2] && sum[mask2] == a[i] ){
dp[i][mask1] = 1;
break;
}
}
}
}
for (int mask = 0; mask < (1 << m); mask++)
{
if (dp[n][mask]){
puts("YES");
return 0;
}
}
puts("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... |