# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499173 | Aktan | Bank (IZhO14_bank) | C++17 | 62 ms | 5080 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 a[100005],b[100005],dp[100005];
vector<int> v[100005];
main(){
int n,m;
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int j=0;j<m;j++){
cin >> b[j];
}
for(int mask=0;mask<(1<<m);mask++){
int sum=0;
for(int j=0;j<m;j++){
if(mask&(1<<j)){
sum+=b[j];
}
}
for(int j=0;j<n;j++){
if(sum==a[j]){
v[j].push_back(mask);
}
}
}
dp[0]=1;
for(int i=0;i<n;i++){
for(int j=(1<<m);j>=0;j--){
if(dp[j]>0){
for(auto it : v[i]){
if(it&j){
continue;
}
int x=it|j;
dp[x]=max(dp[x],dp[j]+1);
if(dp[x]>n){
cout <<"YES";
return 0;
}
}
}
}
}
cout << "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... |