제출 #1272380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272380		hiepsimauhong	은행 (IZhO14_bank)	C++20	52 / 100	1095 ms	8552 KiB

bank

#include <bits/stdc++.h>

using namespace std;

#define int long long
using ll = long long;

#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)

#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';

#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

const int N = 20 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;

int n, m;
int a[N], b[N];
int f[1 << 20], dp[20][1 << 20];

signed main(){ quickly
        cin >> n >> m;

        FOR(i, 1, n){
                cin >> a[i];
        }

        FOR(i, 0, m - 1){
                cin >> b[i];
        }

        FOR(mask, 1, (1 << m) - 1){
                FOR(i, 0, m - 1){
                        if(mask >> i & 1){
                                f[mask] += b[i];
                        }
                }
        }

        dp[0][0] = 1;
        FOR(i, 1, n){
                FOR(mask, 1, (1 << m) - 1){
                        for(int sub = mask ; sub > 0 ; sub = (sub - 1) & mask){
                                if(f[sub] == a[i]){
                                        dp[i][mask] |= dp[i - 1][mask ^ sub];
                                }
                        }
                }
        }

        bool ans = 0;

        FOR(mask, 1, (1 << m) - 1){
                ans |= dp[n][mask];
        }

        cout << (ans == 1 ? "YES" : "NO");
}

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