Submission #590776

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

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < m; i++) cin >> b[i];
	sort(a, a+n);
	sort(b, b+m);
	int full = (1<<m)-1;
	dp[0] = {0, 0};
	bool done = 0;
	for (int i = 1; i <= full && !done; i++) {
		dp[i] = {0, 0};
		for (int j = 0; j < m; j++) {
			if (!(i & (1<<j)) || dp[i].ff > dp[i^(1<<j)].ff) continue;
			PII& tmp = dp[i^(1<<j)];
			if (tmp.ff > dp[i].ff) dp[i] = tmp;
			if (a[tmp.ff] >= b[j]+tmp.ss) dp[i].ss = max(dp[i].ss, b[j]+tmp.ss);
		}
		if (dp[i].ss == a[dp[i].ff]) dp[i] = {dp[i].ff+1, 0};
		done |= dp[i].ff == n;
	}
	cout << (done ? "YES" : "NO") << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 81 ms 8448 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 63 ms 8488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 81 ms 8448 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 63 ms 8488 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 71 ms 8416 KB Output is correct
32 Correct 81 ms 8500 KB Output is correct
33 Correct 117 ms 8496 KB Output is correct
34 Correct 86 ms 8468 KB Output is correct
35 Correct 87 ms 8444 KB Output is correct
36 Correct 75 ms 8396 KB Output is correct
37 Correct 73 ms 8480 KB Output is correct
38 Correct 82 ms 8484 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 73 ms 8436 KB Output is correct
41 Correct 71 ms 8452 KB Output is correct
42 Correct 98 ms 8400 KB Output is correct
43 Correct 99 ms 8484 KB Output is correct
44 Correct 92 ms 8484 KB Output is correct
45 Correct 8 ms 980 KB Output is correct
46 Correct 95 ms 8420 KB Output is correct
47 Correct 86 ms 8380 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 74 ms 8404 KB Output is correct
50 Correct 62 ms 8468 KB Output is correct
51 Correct 85 ms 8536 KB Output is correct
52 Correct 105 ms 8388 KB Output is correct
53 Correct 95 ms 8440 KB Output is correct
54 Correct 61 ms 8448 KB Output is correct
55 Correct 60 ms 8464 KB Output is correct
56 Correct 62 ms 8492 KB Output is correct
57 Correct 66 ms 8476 KB Output is correct
58 Correct 65 ms 8436 KB Output is correct