# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725872 | AndrijaM | Bank (IZhO14_bank) | C++14 | 1085 ms | 8508 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;
int n,m;
int x[23];
int y[23];
int dp[(1<<21)];
bool f(int idx,int mask)
{
if(idx==n)
{
return 1;
}
if(__builtin_popcount(mask)==m)
{
return 0;
}
if(dp[mask]!=-1)return dp[mask];
int rez=0;
for(int i=0;i<(1<<m);i++)
{
int sum=0;
for(int bit=0;bit<=23;bit++)
{
if(i&mask)
{
break;
}
else
{
if(i&(1<<bit))
{
sum+=y[bit];
}
}
}
if(sum==x[idx])
{
int bmask=mask;
bmask|=i;
rez|=f(idx+1,bmask);
}
}
return dp[mask]=rez;
}
int main()
{
memset(dp,-1,sizeof dp);
cin>>n>>m;
for(int i=0;i<n;i++)cin>>x[i];
for(int i=0;i<m;i++)cin>>y[i];
int k=0;
if(f(0,0))
{
cout<<"YES"<<endl;
return 0;
}
cout<<"NO"<<endl;
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... |