Submission #342690

#	Time	Username	Problem	Language	Result	Execution time	Memory
342690		IZhO_2021_I_want_Silver	Bank (IZhO14_bank)	C++14	0 / 100	32 ms	49644 KiB

bank

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = (1 << 21) - 1;
const int oo = 1e9 + 5;

int n, m, a[N], b[N];
vector <int> good[N];
bool was[N];

void go(int pos, int need, int ind, int cur, int mask) {
    if (cur > need) { return; }
    if (pos == m+1) {
        if (need == cur) { good[ind].pb(mask); }
        return;
    }
    go(pos+1, need, ind, cur, mask);
    go(pos+1, need, ind, cur+b[pos], mask + (1 << pos));
}

void rec(int pos, int mask) {
    if (was[mask]) { return; }
    if (pos == n + 1) {
        cout << "YES";
        exit(0);
    }
    for (int i = 0; i < sz(good[pos]); ++i) {
        if (!(mask & good[pos][i])) {
            was[good[pos][i]] = 1;
            rec(pos+1, mask^good[pos][i]);
            was[good[pos][i]] = 0;
        }
    }
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; ++i) {
        cin >> b[i];
    }
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    for (int i = 1; i <= n; ++i) {
        go(1, a[i], i, 0, 0);
    }
    rec(1, 0);
    cout << "NO";
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

bank.cpp:87:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   87 |  main () {
      |        ^

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