oj.uz

Submission #640547

# Submission time Handle Problem Language Result Execution time Memory
640547 2022-09-14T20:41:39 Z ymm Bank (IZhO14_bank) C++17
100 / 100
 542 ms 6476 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 20;
bool dp[2][1<<N];
int a[N], b[N];
int sum[1<<N];
int n, m;

#pragma GCC optimize("O3,unroll-loops")

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n >> m;
	int kooft = 0;
	Loop (i,0,n) {
		cin >> a[i];
		kooft -= a[i];
	}
	Loop (i,0,m) {
		cin >> b[i];
		kooft += b[i];
	}
	if (kooft < 0) {
		cout << "NO" << '\n';
		return 0;
	}
	srand(time(0));
	random_shuffle(a, a+n);
	random_shuffle(b, b+m);
	memset(dp[0], 1, sizeof(dp[0]));
	Loop (i,1,1<<m)
		sum[i] = sum[i ^ (i & -i)] + b[__builtin_ctz(i)];
	Loop (i,0,n) {
		memset(dp[!(i&1)], 0, sizeof(dp[0]));
		Loop (j,1,1<<m) {
			if (sum[j] == a[i]) {
				int sup = j;
				int k = 1 << __builtin_popcount(((1<<m)-1) ^ j);
				if (i&1) {
					Loop (_,0,k) {
						dp[0][sup] |= dp[1][sup ^ j];
						sup = (sup + 1) | j;
					}
				} else {
					Loop (_,0,k) {
						dp[1][sup] |= dp[0][sup ^ j];
						sup = (sup + 1) | j;
					}
				}
			}
		}
		if (!dp[!(i&1)][(1<<m)-1]) {
			cout << "NO\n";
			return 0;
		}
	}
	cout << "YES\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 4 ms 6356 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 15 ms 6356 KB Output is correct
9 Correct 6 ms 6428 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 4 ms 6356 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 15 ms 6356 KB Output is correct
9 Correct 6 ms 6428 KB Output is correct
10 Correct 2 ms 2324 KB Output is correct
11 Correct 2 ms 2260 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 1 ms 2260 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 1 ms 2260 KB Output is correct
20 Correct 2 ms 2388 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 1 ms 2388 KB Output is correct
24 Correct 1 ms 2388 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2388 KB Output is correct
27 Correct 1 ms 2388 KB Output is correct
28 Correct 2 ms 2388 KB Output is correct
29 Correct 2 ms 2388 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 10 ms 6472 KB Output is correct
32 Correct 85 ms 6356 KB Output is correct
33 Correct 17 ms 6356 KB Output is correct
34 Correct 15 ms 6468 KB Output is correct
35 Correct 19 ms 6472 KB Output is correct
36 Correct 37 ms 6356 KB Output is correct
37 Correct 6 ms 6356 KB Output is correct
38 Correct 5 ms 6356 KB Output is correct
39 Correct 82 ms 6356 KB Output is correct
40 Correct 4 ms 6356 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 56 ms 6356 KB Output is correct
43 Correct 21 ms 6476 KB Output is correct
44 Correct 12 ms 6472 KB Output is correct
45 Correct 25 ms 6468 KB Output is correct
46 Correct 23 ms 6356 KB Output is correct
47 Correct 22 ms 6356 KB Output is correct
48 Correct 27 ms 6356 KB Output is correct
49 Correct 5 ms 6368 KB Output is correct
50 Correct 241 ms 6460 KB Output is correct
51 Correct 143 ms 6452 KB Output is correct
52 Correct 299 ms 6452 KB Output is correct
53 Correct 542 ms 6356 KB Output is correct
54 Correct 242 ms 6476 KB Output is correct
55 Correct 239 ms 6408 KB Output is correct
56 Correct 240 ms 6456 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 262 ms 6452 KB Output is correct