제출 #1309760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309760		bluecat	Bank (IZhO14_bank)	C++20	100 / 100	732 ms	90812 KiB

bank

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;
using ll   = long long;
using ld   = long double;
using ui   = unsigned int;
using ull  = unsigned long long;
using i128 = __int128;
using pii  = pair<int, int>;
using pll  = pair<ll, ll>;
using t3i  = tuple<int, int, int>;
using t3l  = tuple<ll, ll, ll>;
using vi   = vector<int>;
using vl   = vector<long long>;
using arr  = array<int, 4>;
using node = pair<int, arr>;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q; cin >> n >> q;
    vector<int> a(n), b(q);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < q; i++) cin >> b[i];
    int w = *max_element(a.begin(),a.end());
    vector<vi> dk(w+1);
    for (int m = 0; m < (1<<q); m++)
    {
        int s = 0;
        for (int i = 0; i < q; i++) if ((m>>i)&1) s += b[i];
        if (s<=w) dk[s].push_back(m);
    }
    vector<vi> d(n+1,vi(1<<q));
    d[0][0] = 1;
    for (int i = 1; i <= n; i++)
        for (int j = 0; j < dk[a[i-1]].size(); j++)
            for (int s = dk[a[i-1]][j], m = s; m < (1<<q); m = (m+1)|s) d[i][m] |= d[i-1][m^s];
    int res = accumulate(d[n].begin(),d[n].end(),0,[](int x, int y){return x|y;});
    cout << (res?"YES":"NO") << "\n";
} 

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