oj.uz

Submission #173746

# Submission time Handle Problem Language Result Execution time Memory
173746 2020-01-05T09:28:36 Z tourist Bank (IZhO14_bank) C++14
100 / 100
 259 ms 16496 KB 
#include <iostream>
#include <time.h>
#include <vector>

using namespace std;

#define ll long long
#define sz(x) (int)x.size()
#define pii pair < int, int >
#define endl "\n"
#define METH ios::sync_with_stdio(0); cin.tie(0);
#define BEGIN cout << "BEGIN" << endl;
#define END cout << "END" << endl;

const int mod = 1e9 + 7;															/// ANOTHER HASH MOD: 228228227
const int prime = 29;																	/// ANOTHER HASH PRIME: 997
const int INF = ((long long) 0xCAFEBABE - 1e9 - 4e8);

int n, m;
short pre[1 << 20];
bool dp[21][1 << 20];
vector < short > a, b;
vector < int > trans[20];

inline void read() {
	cin >> n >> m;
	a.resize(n + 1);
	b.resize(m + 1);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}
}

void calc(int mask, int cnt) {
	if (cnt == n) {
		cout << "YES" << endl;
		exit(0);
	}
	if (dp[cnt][mask]) {
		return;
	}
	dp[cnt][mask] = 1;
	for (int sub : trans[cnt]) {
		if ((mask & sub) == sub) {
			calc(mask ^ sub, cnt + 1);
		}
	}
}

inline int solve() {
	for (int i = 0; i < (1 << m); i++) {
		int sum = 0;
		for (int j = 0; j < m; j++) {
			if (i >> j & 1) {
				sum += b[j];
			}
		}
		pre[i] = sum;
		for (int j = 0; j < n; j++) {
			if (pre[i] == a[j]) {
				trans[j].push_back(i);
			}
		}
	}
	calc((1 << m) - 1, 0);
	cout << "NO" << endl;
	return 0;
}

int main() {
	METH
	int t = 1;
	while (t--) {
		read();
		solve();
	}
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 96 ms 2596 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 83 ms 2396 KB Output is correct
9 Correct 83 ms 2424 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 96 ms 2596 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 83 ms 2396 KB Output is correct
9 Correct 83 ms 2424 KB Output is correct
10 Correct 2 ms 428 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 420 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 4 ms 380 KB Output is correct
30 Correct 4 ms 376 KB Output is correct
31 Correct 84 ms 2488 KB Output is correct
32 Correct 84 ms 2548 KB Output is correct
33 Correct 92 ms 2552 KB Output is correct
34 Correct 96 ms 2512 KB Output is correct
35 Correct 97 ms 2552 KB Output is correct
36 Correct 110 ms 2552 KB Output is correct
37 Correct 83 ms 2424 KB Output is correct
38 Correct 87 ms 2424 KB Output is correct
39 Correct 93 ms 2424 KB Output is correct
40 Correct 95 ms 2428 KB Output is correct
41 Correct 110 ms 2416 KB Output is correct
42 Correct 97 ms 5500 KB Output is correct
43 Correct 95 ms 3136 KB Output is correct
44 Correct 103 ms 2440 KB Output is correct
45 Correct 85 ms 2440 KB Output is correct
46 Correct 90 ms 2424 KB Output is correct
47 Correct 110 ms 2508 KB Output is correct
48 Correct 81 ms 2424 KB Output is correct
49 Correct 80 ms 2424 KB Output is correct
50 Correct 109 ms 2552 KB Output is correct
51 Correct 96 ms 2748 KB Output is correct
52 Correct 96 ms 2552 KB Output is correct
53 Correct 96 ms 2468 KB Output is correct
54 Correct 109 ms 2552 KB Output is correct
55 Correct 110 ms 2552 KB Output is correct
56 Correct 109 ms 2496 KB Output is correct
57 Correct 259 ms 16496 KB Output is correct
58 Correct 108 ms 2464 KB Output is correct