제출 #483758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483758		Olympia	은행 (IZhO14_bank)	C++17	71 / 100	1088 ms	13832 KiB

bank

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <queue>
#include <map>
#define ll signed long long
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    vector<int> dp[1001];
    for (int i = 0; i < (1 << m); i++) {
        ll sum = 0;
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                sum += b[j];
            }
        }
        if (sum <= 1000) {
            dp[sum].push_back(i);
        }
    }
    int ans[n][(1 << m)];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            ans[i][j] = 0;
        }
    }
    for (int i: dp[a[0]]) {
        ans[0][i]++;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            //we want to get sum of a[i]
            vector<int> v = dp[a[i]];
            for (int val: v) {
                if ((val & j) == 0) {
                    ans[i][val + j] += ans[i - 1][j];
                }
            }
        }
    }
    bool bo = false;
    for (int i = 0; i < (1 << m); i++) {
        bo = bo || ans[n - 1][i];
    }
    if (bo) {
        cout << "YES";
    } else {
        cout << "NO";
    }
}

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