제출 #679280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679280		Hacv16	은행 (IZhO14_bank)	C++17	19 / 100	32 ms	7964 KiB

bank

#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
const int MAX = 22;
const int MAXM = 50005;
const int INF = 0x3f3f3f3f;
 
int n, m, a[MAX], b[MAX], sums[1 << MAX];
bool dp[MAX][1 << MAX];
vector<int> g[MAXM];
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    cin >> n >> m;
 
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
 
    for(int mask = 0; mask < (1 << m); mask++){
        int cur = 0;
 
        for(int i = 0; i < m; i++)
            if(mask & (1 << i)) cur += b[i];
 
        g[cur].emplace_back(mask);
    }
 
    dp[0][0] = true;
 
    for(int i = 1; i <= n; i++){
        for(int mask = 0; mask < (1 << m); mask++){
            for(auto sub : g[a[i]]){
                if((mask & sub) != sub) break;
                dp[i][mask] |= (dp[i - 1][mask ^ sub]);
            }
        }
    }
 
    bool pos = false;
 
    for(int mask = 0; mask < (1 << m); mask++)
        pos |= dp[n][mask];
 
    cout << (pos ? "YES" : "NO") << '\n';
 
    exit(0);
}

• Subtask 1: 19 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29