제출 #1219298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219298		trufanov.p	Bank (IZhO14_bank)	C++20	71 / 100	1099 ms	90696 KiB

bank

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <string>
#include <queue>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <cmath>
#include <unordered_map>

using namespace std;

#pragma GCC optimize("O3")
//#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

typedef long long ll;

inline bool in(int mask, int i) {
    return (mask >> i) & 1;
}

inline int del(int mask, int i) {
    return mask & (~(1 << i));
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    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> pref(n);
    partial_sum(a.begin(), a.end(), pref.begin());
    vector<int> sum(1 << m);
    sum[0] = 0;
    for (int mask = 1; mask < (1 << m); ++mask) {
        for (int i = 0; i < m; ++i) {
            if (in(mask, i)) {
                sum[mask] = sum[del(mask, i)] + b[i];
            }
        }
    }
    vector<vector<int>> dp(n, vector<int>(1 << m));
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < (1 << m); ++mask) {
            if (i == 0) {
                if (sum[mask] == a[i]) {
                    dp[i][mask] = 1;
                }
                for (int j = 0; j < m; ++j) {
                    if (in(mask, j) && dp[i][del(mask, j)]) {
                        dp[i][mask] = 1;
                    }
                }
                continue;
            }
            for (int j = 0; j < m; ++j) {
                int mask1 = del(mask, j);
                if (!in(mask, j)) {
                    continue;
                }
                if (dp[i - 1][mask1] && sum[mask1] - pref[i - 1] + b[j] == a[i]) {
                    dp[i][mask] = 1;
                }
                if (dp[i][mask1]) {
                    dp[i][mask] = 1;
                }
            }
        }
    }
    cout << (find(dp[n - 1].begin(), dp[n - 1].end(), 1) != dp[n - 1].end() ? "YES\n" : "NO\n");
}

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