# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852644 | batsukh2006 | Bank (IZhO14_bank) | C++11 | 358 ms | 21592 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<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map>
using namespace std;
#define MOD 1000000007
#define int long long
#define endl '\n'
void solve(){
int n,m; cin>>n>>m;
int a[n+1],b[m+1];
int sum=0;
for(int i=1; i<=n; i++) cin>>a[i];
for(int i=1; i<=m; i++) cin>>b[i];
vector<vector<bool> > dp(n+1,vector<bool>(1<<m));
vector<int> v[200001];
for(int i=0; i<(1<<m); i++){
int sum=0;
for(int j=0; j<m; j++){
if(i&(1<<j)) sum+=b[j+1];
}
v[sum].push_back(i);
}
dp[0][0]=1;
for(int i=1; i<=n; i++){
for(int j=0; j<(1<<m); j++){
if(dp[i-1][j]){
for(int l=0; l<v[a[i]].size(); l++){
if((j&v[a[i]][l])==0) dp[i][j|v[a[i]][l]]=1;
}
}
}
}
for(int i=0; i<(1<<m); i++){
if(dp[n][i]){
cout<<"YES";
return;
}
}
cout<<"NO";
}
signed main(){
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
cout<<endl;
}
return 0;
}
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... |