Submission #1281740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281740		blackscreen1	Bank (IZhO14_bank)	C++20	100 / 100	180 ms	32308 KiB

bank

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
ll n, m;
ll a[25], b[25];
vector<ll> av[1005], can[25];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	iloop(0, n) cin >> a[i];
	iloop(0, m) cin >> b[i];
	sort(a, a+n);
	sort(b, b+m);
	ll cs = 0;
	iloop(0, 1<<m) {
		cs = 0;
		jloop(0, m) if (i&(1<<j)) cs += b[j];
		if (cs <= 1000) av[cs].push_back(i);
	}
	can[0].push_back(0);
	iloop(0, n) {
		for (auto it : can[i]) {
			for (auto it2 : av[a[i]]) if ((it&it2) == 0) can[i+1].push_back(it|it2);
		}
		sort(can[i+1].begin(), can[i+1].end());
		can[i+1].erase(unique(can[i+1].begin(), can[i+1].end()), can[i+1].end());
	}
	cout << (can[n].size() ? "YES" : "NO");
}

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