Submission #1179968

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179968		Nonoze	은행 (IZhO14_bank)	C++20	52 / 100	1094 ms	52704 KiB

bank

/*
*	Author: Nonoze
*	Created: Sunday 06/04/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<int> a, b;


void solve() {
	read(n, m);
	a.clear(), a.resize(n); read(a);
	b.clear(), b.resize(m); read(b);
	vector<unordered_map<int, int>> possibilities(n);
	for (int mask=1; mask<(1<<m); mask++) {
		int sm=0;
		for (int i=0; i<m; i++) if (mask&(1<<i)) sm+=b[i];
		for (int i=0; i<n; i++) {
			if (sm==a[i]) possibilities[i][mask]=1;
		}
	}
	vector<int> dp(1<<m, 0);
	for (int mask=(1<<m)-1; mask>=0; mask--) {
		if (dp[mask]==n) QYES;
		for (int mask2=mask; mask2; mask2=(mask2-1)&mask) {
			if (possibilities[dp[mask]][mask2]) {
				dp[mask^mask2]=max(dp[mask^mask2], dp[mask]+1);
			}
		}
	}
	QNO;
}

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