# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671859 | Baytoro | Bank (IZhO14_bank) | C++17 | 35 ms | 6484 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;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
//#define int long long
#define endl '\n'
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=1e9+7;
int n,m;
void get(int x){
for(int i=0;i<m;i++)
cout<<((x&(1<<i))?1:0);
cout<<endl;
}
int dp[(1<<20)+5];
int ok[(1<<20)+5];
void solve(){
memset(ok,-1,sizeof(ok));
cin>>n>>m;
vector<int> a(n+1),b(m+1);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
for(int i=0;i<n;i++){
for(int mask=1;mask<(1<<(m-1));mask++){
for(int j=0;j<m;j++){
if(mask&(1<<j)){
//cout<<ok[(mask^(1<<j))]<<endl;
if(ok[mask^(1<<j)]<i-1) continue;
dp[mask]=(dp[mask^(1<<j)])+b[j];
//get(mask);cout<<' '<<dp[mask];
if(dp[mask]>a[i]) continue;
ok[mask]=i-1;
if(dp[mask]==a[i]){
dp[mask]=0;
ok[mask]=i;
//get(mask);
if(i==n-1){
cout<<"YES\n";
return;
}
}
break;
}
}
}
}
cout<<"NO\n";
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
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... |