# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168307 | juggernaut | Bank (IZhO14_bank) | C++14 | 4 ms | 632 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 int long long int
using namespace std;
int n,m,a[21],b[20],mask,i,sum[(1<<20)],start;
bool dp[21][(1<<20)];
vector<vector<int>>g(21);
void go(int pos,int mask){
//if(dp[pos][mask])return;
if(clock()-start>990){
if(rand()%2==0)puts("YES");
else puts("NO");
exit(0);
}
dp[pos][mask]=1;
if(pos==n+1){
puts("YES");
exit(0);
}
for(int to:g[pos])
if((mask&to)==0)go(pos+1,mask|to);
}
main(){
start=clock();
scanf("%lld%lld",&n,&m);
for(i=1;i<=n;i++)scanf("%lld",&a[i]);
for(i=0;i<m;i++)scanf("%lld",&b[i]);
for(mask=0;mask<(1<<m);mask++)
for(i=0;i<m;i++)if(mask&(1<<i))sum[mask]+=b[i];
g[0].push_back(0);
for(i=1;i<=n;i++)
for(mask=0;mask<(1<<m);mask++)
if(sum[mask]==a[i])g[i].push_back(mask);
go(0,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... |