제출 #922736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922736		eysbutno	은행 (IZhO14_bank)	C++11	71 / 100	1034 ms	6852 KiB

bank

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define pb push_back
#define ins insert
#define f first 
#define s second 

bitset<1 << 20> dp[2];
vector<int> msks[1001];
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    for (int& i : a) cin >> i;
    for (int& i : b) cin >> i; 
    for (int i = 0; i < (1 << m); i++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if (i >> j & 1) sum += b[j];
        }
        if (sum <= 1000) msks[sum].pb(i);
    }  
    for (int i : msks[a[0]]) {
        dp[0][i] = true;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            for (int k : msks[a[i]]) {
                if ((j & k) == k) {
                    dp[1][j] = dp[1][j] | dp[0][j ^ k];
                }
            }
        }     
        dp[0].reset();
        swap(dp[0], dp[1]);
    } 
    for (int i = 0; i < (1 << m); i++) {
        if (dp[0][i]) {
            cout << "YES" << '\n';
            return 0;
        }
    }
    cout << "NO" << '\n';
}

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