# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167971 | juggernaut | Bank (IZhO14_bank) | C++14 | 1054 ms | 504 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,i,mask,mx,a[11],b[10],sum,j;
bool dp[11][1024];
main(){
scanf("%d%d",&n,&m);
mx=(1<<m)-1;
for(i=0;i<=mx;i++)dp[0][i]=1;
for(i=1;i<=n;i++)scanf("%d",&a[i]);
for(i=0;i<m;i++)scanf("%d",&b[i]);
if(n==1){
for(mask=0;mask<=mx;mask++){
sum=0;
for(i=0;i<m;i++)if(mask&(1<<i))sum+=b[i];
if(sum==a[1]){
puts("YES");
return 0;
}
}
puts("NO");
return 0;
}
for(i=1;i<=n;i++){
for(mask=0;mask<=mx;mask++){
sum=0;
for(j=0;j<m;j++)
if(mask&(1<<j))sum+=b[j];
if(sum==a[i]){
for(j=0;j<=mx;j++)
if((j&(mx^mask))==j&&dp[i-1][j]){
dp[i][(mask|j)]=1;
break;
}
}
}
}
for(i=0;i<=mx;i++)if(dp[n][i]){
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... |