Submission #388356

# Submission time Handle Problem Language Result Execution time Memory
388356 2021-04-11T05:07:27 Z ronnith Bank (IZhO14_bank) C++14
100 / 100
177 ms 1396 KB
#include <bits/stdc++.h>

using namespace std;

const int N = 20;
const int M = 20;
const int MX_A = 1000;
const int MX_B = 1000;

int n, m, a[N], b[M];
bool dp[1<<M];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 0;i < n;i ++) {
		cin >> a[i];
		if(i != 0) {
			a[i] += a[i - 1];
		}
	}
	for(int i = 0;i < m;i ++) {
		cin >> b[i];
	}
	dp[0] = true;
	for(int mask = 0;mask < (1<<m);mask ++) {
		int sm = 0;
		for(int i = 0;i < m;i ++) {
			if((1<<i)&mask) {
				sm += b[i];
			}
		}
		if(sm > a[n - 1]) continue;
		int ptr = 0;
		while(a[ptr] < sm) ptr ++;
		for(int i = 0;i < m;i ++) {
			if((1<<i)&mask && b[i] <= sm - (ptr == 0 ? 0 : a[ptr - 1])) {
				if(dp[mask^(1<<i)]) {
					dp[mask] = true;
		//			if(mask == 12) {
		//				cerr << i << '\n';
		//			}
					break;
				}
			}
		}
		if(sm == a[n - 1] && dp[mask]) {
		//	cerr << sm << '\n';
		//	for(int i = m - 1;i >= 0;i --) {
		//		cout << ((mask>>i)&1);
		//	}
		//	cout << '\n';
			cout << "YES\n";
			return 0;
		}
	}
	cout << "NO\n";
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 64 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 75 ms 1268 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 64 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 75 ms 1268 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 204 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 3 ms 332 KB Output is correct
29 Correct 3 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 92 ms 1372 KB Output is correct
32 Correct 83 ms 1268 KB Output is correct
33 Correct 168 ms 1224 KB Output is correct
34 Correct 167 ms 808 KB Output is correct
35 Correct 174 ms 888 KB Output is correct
36 Correct 177 ms 484 KB Output is correct
37 Correct 64 ms 460 KB Output is correct
38 Correct 64 ms 324 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 121 ms 336 KB Output is correct
41 Correct 175 ms 332 KB Output is correct
42 Correct 133 ms 1280 KB Output is correct
43 Correct 170 ms 1272 KB Output is correct
44 Correct 166 ms 324 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 155 ms 1304 KB Output is correct
47 Correct 160 ms 380 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 64 ms 364 KB Output is correct
50 Correct 103 ms 1296 KB Output is correct
51 Correct 147 ms 452 KB Output is correct
52 Correct 154 ms 1304 KB Output is correct
53 Correct 91 ms 1312 KB Output is correct
54 Correct 103 ms 1220 KB Output is correct
55 Correct 104 ms 1220 KB Output is correct
56 Correct 94 ms 1312 KB Output is correct
57 Correct 94 ms 1220 KB Output is correct
58 Correct 93 ms 1396 KB Output is correct