oj.uz

Submission #798589

# Submission time Handle Problem Language Result Execution time Memory
798589 2023-07-30T21:11:13 Z cryan Bank (IZhO14_bank) C++17
100 / 100
 102 ms 8532 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() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;

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

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

	vector<pi> dp(1 << m, {-inf, -inf});

	dp[0] = {0, 0};

	for (int i = 1; i < (1 << m); i++) {
		for (int j = 0; j < m; j++) {
			if (i & (1 << j)) {
				int prev = i ^ (1 << j);
				if (dp[prev].f == -inf)
					continue;
				if (dp[prev].s + b[j] < a[dp[prev].f]) {
					dp[i] = dp[prev];
					dp[i].s += b[j];
				} else if (dp[prev].s + b[j] == a[dp[prev].f]) {
					dp[i] = dp[prev];
					dp[i].f++;
					dp[i].s = 0;
				}
			}
		}
		if (dp[i].f == n) {
			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 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 69 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 73 ms 8532 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 316 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 0 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 452 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 69 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 73 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 316 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 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 452 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 88 ms 8532 KB Output is correct
32 Correct 94 ms 8444 KB Output is correct
33 Correct 73 ms 8532 KB Output is correct
34 Correct 72 ms 8532 KB Output is correct
35 Correct 69 ms 8532 KB Output is correct
36 Correct 71 ms 8532 KB Output is correct
37 Correct 75 ms 8532 KB Output is correct
38 Correct 71 ms 8532 KB Output is correct
39 Correct 4 ms 8416 KB Output is correct
40 Correct 72 ms 8532 KB Output is correct
41 Correct 70 ms 8496 KB Output is correct
42 Correct 102 ms 8532 KB Output is correct
43 Correct 73 ms 8532 KB Output is correct
44 Correct 73 ms 8532 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 85 ms 8532 KB Output is correct
47 Correct 72 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 71 ms 8532 KB Output is correct
50 Correct 85 ms 8532 KB Output is correct
51 Correct 72 ms 8532 KB Output is correct
52 Correct 69 ms 8532 KB Output is correct
53 Correct 89 ms 8508 KB Output is correct
54 Correct 88 ms 8532 KB Output is correct
55 Correct 76 ms 8532 KB Output is correct
56 Correct 82 ms 8532 KB Output is correct
57 Correct 76 ms 8512 KB Output is correct
58 Correct 76 ms 8532 KB Output is correct