This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
* With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
* TASK : Bank
* AUTHOR : Marszpace
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m;
cin >> n >> m;
vector<int> ppl(n);
vector<int> notes(m);
for(int i=0;i<n;i++){
cin >> ppl[i];
}
for(int i=0;i<m;i++){
cin >> notes[i];
}
vector<vector<bool>> dp(n+1,vector<bool>((1<<m),2));
for(int s=0;s<(1<<m);s++){
dp[n][s]=true;
}
for(int p=0;p<n;p++){
for(int s=0;s<(1<<m);s++){
for(int nexts=0;nexts<(1<<m);nexts++){
int val=0,valid=1;
for(int i=0;i<m;i++){
if((s&(1<<i))==0&&(nexts&(1<<i))==(1<<i)){
val+=notes[i];
}
if((s&(1<<i))==(1<<i)&&(nexts&(1<<i))==0){
valid=0;
}
}
//cout << nexts << " " << val << " " << valid << endl;
if(valid&&val==ppl[p]){
if(dp[p+1][nexts]){dp[p][s]=true;continue;}
}
}
dp[p][s]=false;
}
}
cout << (dp[0][0]?"YES":"NO");
return 0;
}
# | 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... |