제출 #1182471

#제출 시각아이디문제언어결과실행 시간메모리
1182471FaresSTH은행 (IZhO14_bank)C++20
71 / 100
1096 ms28940 KiB
#include "bits/stdc++.h" using namespace std; int n,m,a[25],b[25],f[1001]; vector<pair<int,int>>s; map<int,bool>memo; bool sol(int i,int used){ if(i==n)return 1; if(memo.find((i<<20)|used)!=memo.end())return memo[(i<<20)|used]; for(auto[sum,mask]:s){ if(sum!=a[i]||(used&mask))continue; if(sol(i+1,used|mask))return memo[(i<<20)|used]=1; } return memo[(i<<20)|used]=0; } 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); } cout<<(sol(0,0)?"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...