oj.uz

Submission #798578

# Submission time Handle Problem Language Result Execution time Memory
798578 2023-07-30T20:56:53 Z cryan Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 112492 KB 
// oh, these hills, they burn so bright / oh, these hills, they bring me life
#include "bits/stdc++.h"
using namespace std;

using ll = long long;
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x.size())
#define inf 1000000010
#define linf 0x3f3f3f3f3f3f3f3f
#define mp make_pair
#define f first
#define s second
#define pi pair<int, int>
#ifdef __INTELLISENSE__
#include "/mnt/c/yukon/pp.hpp"
#endif
#ifndef LOCAL
#define endl "\n"
#else
#include "/mnt/c/yukon/pp.hpp"
#endif

int main() {
	int n, m;
	cin >> n >> m;

	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}

	vector<int> b(m);
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}

	vector<vector<vector<int>>> combos(n + 1);

	for (int i = 1; i <= n; i++) {
		vector<vector<vector<int>>> pp(a[i] + 1);
		pp[0].push_back(vector<int>());

		for (int bank = 0; bank < m; bank++) {
			for (int val = 1; val <= a[i]; val++) {
				if (val - b[bank] >= 0) {
					int bruhmoment = sz(pp[val]);

					for (auto kk : pp[val - b[bank]]) {
						if (find(all(kk), bank) == kk.end()) {
							pp[val].push_back(kk);
						}
					}
					for (int l = bruhmoment; l < sz(pp[val]); l++) {
						pp[val][l].push_back(bank);
					}
				}
			}
		}

		combos[i] = pp[a[i]];
	}

	vector<vector<bool>> dp(n + 1, vector<bool>(1 << m, false));

	dp[0][0] = 1;

	for (int i = 1; i <= n; i++) {
		for (auto &k : combos[i]) {
			vector<int> pos;
			int wahhhh = 0;
			for (int gg = 0; gg < m; gg++) {
				if (find(all(k), gg) == k.end()) {
					pos.push_back(gg);
				} else {
					wahhhh += (1 << gg);
				}
			}

			for (int mask = 0; mask < (1 << sz(pos)); mask++) {
				int now = wahhhh;
				for (int clown = 0; clown < sz(pos); clown++) {
					if ((1 << clown) & mask) {
						now += (1 << pos[clown]);
					}
				}

				dp[i][now] = dp[i][now] || dp[i - 1][now - wahhhh];
				//cout << i << ' ' << bitset<6>(mask) << ": " << dp[i][mask] << endl;
				//cout << "REF: " << i - 1 << ' ' << bitset<6>(before) << endl;
				if (i == n && dp[i][now]) {
					cout << "YES" << endl;
					return 0;
				}
			}
		}
	}
	cout << "NO" << endl;
}

// don't get stuck on one approach
// question bounds
// flesh out your approach before implementing o.o
// math it out
// ok well X is always possible, how about X + 1 (etc.)

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 88 ms 44708 KB Output is correct
9 Correct 223 ms 112492 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 4 ms 304 KB Output is correct
4 Correct 14 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 4 ms 300 KB Output is correct
11 Correct 37 ms 1620 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 88 ms 44708 KB Output is correct
9 Correct 223 ms 112492 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 4 ms 304 KB Output is correct
23 Correct 14 ms 340 KB Output is correct
24 Correct 5 ms 340 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 2 ms 304 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 4 ms 300 KB Output is correct
30 Correct 37 ms 1620 KB Output is correct
31 Correct 378 ms 63356 KB Output is correct
32 Execution timed out 1088 ms 40164 KB Time limit exceeded
33 Halted 0 ms 0 KB -