Submission #661250

#	Time	Username	Problem	Language	Result	Execution time	Memory
661250		hafo	Bank (IZhO14_bank)	C++14	100 / 100	572 ms	16732 KiB

bank

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 20;
const ll oo = 1e15 + 69;

int n, m, a[maxn], b[maxn];
pa dp[1 << maxn][2];

bool getbit(const int mask, int i) {
    return ((mask >> i) & 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin>>n>>m;
    for(int i = 0; i < n; i++) cin>>a[i];
    for(int i = 0; i < m; i++) cin>>b[i];

    for(int i = 0; i < 2; i++)
        for(int mask = 0; mask < (1 << m); mask++) dp[mask][i] = make_pair(-1, 0);

    dp[(1 << m) - 1][0] = {0, 0};
    for(int i = 0; i < n; i++)
        for(int mask = (1 << m) - 1; mask; mask--) {
            if(dp[mask][i & 1].fi == i)
                for(int x = mask; x; x -= x&-x) {
                    int j = __builtin_ctz(x), s = dp[mask][i & 1].se + b[j], add = (s == a[i]);
                    dp[mask ^ (1 << j)][i & 1 ^ add] = {i + add, (add == 0 ? s:0)};
                    if(i + add == n) {
                        cout<<"YES";
                        exit(0);
                    }
                }
            dp[mask][i & 1] = {-1, 0};
        }
    cout<<"NO";
    return 0;
}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:45:43: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   45 |                     dp[mask ^ (1 << j)][i & 1 ^ add] = {i + add, (add == 0 ? s:0)};
      |                                         ~~^~~

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