Submission #541198

#TimeUsernameProblemLanguageResultExecution timeMemory
541198status_codingBank (IZhO14_bank)C++14
0 / 100
1091 ms11560 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("unroll-loops") using namespace std; int n,m; int a[22], b[22]; int sum[2000005]; vector<int> fr[1005]; bool dp[12][2000005]; int main() { cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=m;i++) cin>>b[i]; for(int mask=0; mask < (1<<m); mask++) { for(int k=0;k<m;k++) if((mask >> k) & 1) sum[mask] += b[k]; if(sum[mask] <= 1000) fr[ sum[mask] ].push_back(mask); } for(int mask=0;mask<(1<<m);mask++) dp[0][mask] = true; for(int i=1;i<=n;i++) for(int mask=0; mask < (1<<m); mask++) { for(int nmask : fr[a[i]]) if((mask | nmask) == mask && dp[i-1][mask - nmask]) dp[i][mask] = true; } bool ok=false; for(int mask=0;mask<(1<<m);mask++) if(dp[n][mask]) ok=true; if(ok) cout<<"YES"; else cout<<"NO"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...