Submission #982853

#TimeUsernameProblemLanguageResultExecution timeMemory
982853dpsaveslivesBank (IZhO14_bank)C++17
71 / 100
1065 ms4572 KiB
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 21;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N,M; cin >> N >> M;
    vector<int> arr(N),bank(M);
    for(int i = 0;i<N;++i) cin >> arr[i];
    for(int i = 0;i<M;++i) cin >> bank[i];
    vector<vector<int>> poss(N);
    for(int i = 0;i<N;++i){
        for(int j = 1;j<(1<<M);++j){
            int cur = 0;
            for(int k = 0;k<M;++k){
                if((1<<k)&j){
                    cur += bank[k];
                }
            }
            if(cur == arr[i]){
                poss[i].push_back(j);
            }
        }
    }
    vector<int> dp((1<<M),-1); dp[0] = 0;
    for(int i = 0;i<N;++i){
        for(int j = (1<<M)-1;j>=0;--j){
            if(dp[j] == -1) continue;
            for(auto t : poss[i]){
                if(!(t&j)){
                    dp[t|j] = dp[j]+1;
                    if(dp[t|j] == N){
                        cout << "YES\n";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "NO\n";
    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...