이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
* 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 n,m;
vector<int> ppl(20);
vector<int> notes(20);
vector<vector<int>> dp(20,vector<int>((1<<20),2));
bool recur(int p, int s){
//cout << p << " " << s << endl;
if(p==n){return true;}
if(dp[p][s]!=2){return dp[p][s];}
for(int nexts=0;nexts<(1<<m);nexts++){
if((nexts|s)!=nexts){continue;}
int val=0;
for(int i=0;i<m;i++){
if((s&(1<<i))==0&&(nexts&(1<<i))==(1<<i)){
val+=notes[i];
}
}
if(val==ppl[p]){
bool res=recur(p+1,nexts);
if(res){dp[p][s]=1;return true;}
}
}
dp[p][s]=0;
return false;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> ppl[i];
}
for(int i=0;i<m;i++){
cin >> notes[i];
}
cout << (recur(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... |