# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725897 | AndrijaM | Bank (IZhO14_bank) | C++14 | 1079 ms | 4420 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 kolku;
int n,m;
int x[20];
int y[20];
int dp[(1<<20)];
bool f(int idx,int mask)
{
if(idx==n)
{
return 1;
}
if(mask==kolku)
{
return 0;
}
if(dp[mask]!=-1)return dp[mask];
int rez=0;
for(int i=0;i<(1<<m);i++)
{
int sum=0;
if(i&mask)
{
for(int bit=0;bit<m;bit++)
{
if(i&mask)
{
if(i&(1<<bit) && mask&(1<<bit))
{
i^=(1<<bit);
int b=bit+1;
if(b<m)
{
i|=(1<<bit);
}
}
else
{
i^=(1<<bit);
}
}
else
{
break;
}
}
i--;
}
else
{
for(int bit=0;bit<m;bit++)
{
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()
{
ios::sync_with_stdio(0);
memset(dp,-1,sizeof dp);
cin>>n>>m;
kolku=(1<<m)-1;
for(int i=0;i<n;i++)cin>>x[i];
for(int i=0;i<m;i++)cin>>y[i];
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... |