Submission #1272918

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272918		hiepsimauhong	Bank (IZhO14_bank)	C++20	71 / 100	1094 ms	8772 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);
#define div alksdjf

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

int n, m;
int a[N], b[N], f[1 << N];
vector<int> choose[N];

void back_track(int i, int mask){
        if(i == n){
                cout << "YES";
                exit(0);
        }

        FOA(sub, choose[i]){
                if((sub & mask) == 0){
                        back_track(i + 1, mask ^ sub);
                }
        }
}

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

        FOR(i, 0, n - 1){
                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];
                        }
                }
        }

        FOR(i, 0, n - 1){
                FOR(mask, 1, (1 << m) - 1){
                        if(f[mask] == a[i]){
                                choose[i].push_back(mask);
                        }
                }
        }

        back_track(0, 0);
        cout << "NO";
}

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