Submission #873877

#	Time	Username	Problem	Language	Result	Execution time	Memory
873877		noiaint	Bank (IZhO14_bank)	C++17	100 / 100	399 ms	116816 KiB

bank

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

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

bool calc(int i, int x) {
	if (i == n) return true;
	int &res = f[i][x];
	if (res != -1) return res;
	res = 0;
	for (int y : ok[a[i]]) {
		if ((x & y) == 0) res |= calc(i + 1, x | y);
	}
	return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    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 mask = 0; mask < bit(m); ++mask) {
    	int s = 0;
    	for (int i = 0; i < m; ++i) s += getbit(mask, i) * b[i];
    	ok[s].emplace_back(mask);
    }

    memset(f, -1, sizeof f);

    cout << (calc(0, 0) ? "YES" : "NO");

    return 0;
}

/*

*/

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