제출 #1189615

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189615		North1304	은행 (IZhO14_bank)	C++20	100 / 100	326 ms	20620 KiB

bank

#include <bits/stdc++.h>
using namespace std;
const int N = 21;
const int S = 1001;
int a[N] , b[N];
bool dp[N][1<<N];
vector<int> vec[S];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n,m;
    cin >> n >> m;
    for (int i=1;i<=n;i++) cin >> a[i];
    for (int i=0;i<m;i++) cin >> b[i];
    dp[0][0] = true;
    int k = 1<<m;
    for (int i=0;i<k;i++) {
        int sum = 0;
        for (int j=0;j<m;j++) {
            if (i&(1<<j)) sum += b[j];
        }
        if (sum<=1000) vec[sum].push_back(i);
    }
    for (int i=1;i<=n;i++) {
        for (int j=0;j<k;j++) {
            if (dp[i-1][j]) {
                for (auto sum:vec[a[i]]) {
                    if (j&sum) continue;
                    dp[i][j|sum] = 1;
                }
            }
            
        }
    }
    bool ans = false;
    for (int i=0;i<k;i++) ans |= dp[n][i];
    if (ans) cout << "YES";
    else cout << "NO";
    return 0;
}

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