제출 #1182731

#제출 시각아이디문제언어결과실행 시간메모리
1182731FaresSTH은행 (IZhO14_bank)C++20
52 / 100
1093 ms792 KiB
#include "bits/stdc++.h" using namespace std; int n,m,a[25],b[25],f[1001]; vector<pair<int,int>>s; bool dp[25][1<<20]; int main(){ cin.tie(0)->sync_with_stdio(0); cin>>n>>m; for(int i=0;i<n;i++)cin>>a[i],f[a[i]]++; for(int i=0;i<m;i++)cin>>b[i]; 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]; } if(sum<=1000&&f[sum])s.emplace_back(sum,mask); } dp[0][0]=1; for(int i=1;i<=n;i++){ for(auto[sum,mask]:s){ if(sum!=a[i-1])continue; for(int k=0;k<(1<<m);k++){ if((k&mask)==0&&dp[i-1][k])dp[i][(k|mask)]=1; } } } cout<<(*max_element(dp[n],dp[n]+(1<<m))?"YES":"NO"); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...