제출 #330390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330390		Vince729	은행 (IZhO14_bank)	C++11	0 / 100	1080 ms	1260 KiB

bank

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<complex>
using namespace std;

typedef long long ll;
typedef complex<double> pt;
#define x() real()
#define y() imag()
#define smx(a, b) a = max(a, b)
#define smn(a, b) a = min(a, b)
#define in(mp, v) mp.find(v) != mp.end()

const int MAXN = 20;
const int MOD = 1000000007;

int n, m, a[MAXN+1], b[MAXN];
bool dp[MAXN+1][1<<MAXN];
vector<int> combs[MAXN];

int sum(int x) {
    int ret = 0, i = 1;
    for (; x; i++, x>>=1) ret += b[i]*(x&1);
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int j = 0; j < m; j++) cin >> b[j];

    dp[0][0] = true;
    bool found = false;
    for (int i = 1; i <= n; i++) {
        found = false;
        for (int k = 0; k < (1<<m); k++) {
            if (sum(k) == a[i]) combs[i].push_back(k);
            for (int msk : combs[i]) {
                dp[i][k] |= dp[i-1][k & ~msk];
            }
            found |= dp[i][k];
            //cout << k << " " << dp[i][k] << endl;
        }
        if (!found) break;
    }
    if (found) {
        cout << "YES" << endl;
    } else cout << "NO" << endl;
}

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