Submission #590771

# Submission time Handle Problem Language Result Execution time Memory
590771 2022-07-06T10:55:38 Z Mazaalai Bank (IZhO14_bank) C++17
100 / 100
130 ms 8632 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const int N = 21;
const int M = 1<<N;
using VI = vector <int>;
using PII = pair <int, int>;
int n, m;
int a[N], b[N], s[N];
PII dp[M];

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	// freopen("0.in", "r", stdin);
	// freopen("0.out", "w", stdout);
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < m; i++) cin >> b[i];
	a[n] = 1e9;
	int full = (1<<m)-1;
	dp[0] = {0, 0};

	for (int i = 1; i <= full; i++) {
		dp[i] = {0, 0};
		for (int j = 0; j < m; j++) {
			int prev = i^(1<<j), num = b[j];
			PII tmp = dp[prev];
			if (i < prev || dp[i].ff > tmp.ff) continue;
			if (tmp.ff > dp[i].ff) dp[i] = tmp;
			if (a[tmp.ff] >= num+tmp.ss) dp[i].ss = max(dp[i].ss, num+tmp.ss);
		}
		if (dp[i].ss == a[dp[i].ff]) dp[i] = {dp[i].ff+1, 0};
	}
	cout << (dp[full].ff == n ? "YES" : "NO") << "\n";
}
# 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 332 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 87 ms 8452 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 94 ms 8500 KB Output is correct
9 Correct 74 ms 8404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 340 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 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
# 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 332 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 87 ms 8452 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 94 ms 8500 KB Output is correct
9 Correct 74 ms 8404 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 340 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 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 456 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 83 ms 8428 KB Output is correct
32 Correct 86 ms 8420 KB Output is correct
33 Correct 114 ms 8632 KB Output is correct
34 Correct 92 ms 8472 KB Output is correct
35 Correct 111 ms 8520 KB Output is correct
36 Correct 87 ms 8508 KB Output is correct
37 Correct 103 ms 8508 KB Output is correct
38 Correct 83 ms 8512 KB Output is correct
39 Correct 69 ms 8472 KB Output is correct
40 Correct 97 ms 8520 KB Output is correct
41 Correct 85 ms 8456 KB Output is correct
42 Correct 126 ms 8448 KB Output is correct
43 Correct 113 ms 8412 KB Output is correct
44 Correct 101 ms 8396 KB Output is correct
45 Correct 120 ms 8416 KB Output is correct
46 Correct 130 ms 8492 KB Output is correct
47 Correct 107 ms 8512 KB Output is correct
48 Correct 96 ms 8496 KB Output is correct
49 Correct 81 ms 8396 KB Output is correct
50 Correct 83 ms 8468 KB Output is correct
51 Correct 99 ms 8488 KB Output is correct
52 Correct 100 ms 8484 KB Output is correct
53 Correct 96 ms 8420 KB Output is correct
54 Correct 90 ms 8444 KB Output is correct
55 Correct 115 ms 8428 KB Output is correct
56 Correct 78 ms 8460 KB Output is correct
57 Correct 94 ms 8480 KB Output is correct
58 Correct 85 ms 8472 KB Output is correct