Submission #76745

# Submission time Handle Problem Language Result Execution time Memory
76745 2018-09-17T12:46:11 Z szawinis Bank (IZhO14_bank) C++17
71 / 100
1000 ms 740 KB
#include <bits/stdc++.h>
using namespace std;

int n, m, a[20], b[20];

int curr[20];
bool solve(int idx, int mask) {
	if(n - __builtin_popcount(mask) > m - idx) return false;
	if(mask == (1 << n) - 1) return true;
	if(solve(idx + 1, mask)) return true;
	for(int i = 0; i < n; i++) if(!(mask >> i & 1)) {
		bool res = false;
		curr[i] += b[idx];
		if(curr[i] == a[i]) res |= solve(idx + 1, mask | 1 << i);	
		else res |= solve(idx + 1, mask);
		curr[i] -= b[idx];
		if(res) return true;
	}
	return false;
}

int main() {
	ios::sync_with_stdio(false);
	cin.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];
	if(solve(0, 0)) cout << "YES" << endl;
	else cout << "NO" << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 17 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 456 KB Output is correct
9 Correct 17 ms 564 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 564 KB Output is correct
2 Correct 2 ms 564 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 2 ms 680 KB Output is correct
10 Correct 2 ms 680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 140 ms 680 KB Output is correct
2 Correct 75 ms 680 KB Output is correct
3 Correct 6 ms 680 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 3 ms 680 KB Output is correct
6 Correct 518 ms 680 KB Output is correct
7 Correct 118 ms 680 KB Output is correct
8 Correct 142 ms 680 KB Output is correct
9 Correct 45 ms 680 KB Output is correct
10 Correct 45 ms 740 KB Output is correct
11 Correct 2 ms 740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 17 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 456 KB Output is correct
9 Correct 17 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 2 ms 564 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 2 ms 564 KB Output is correct
16 Correct 2 ms 564 KB Output is correct
17 Correct 3 ms 564 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 2 ms 680 KB Output is correct
20 Correct 140 ms 680 KB Output is correct
21 Correct 75 ms 680 KB Output is correct
22 Correct 6 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 3 ms 680 KB Output is correct
25 Correct 518 ms 680 KB Output is correct
26 Correct 118 ms 680 KB Output is correct
27 Correct 142 ms 680 KB Output is correct
28 Correct 45 ms 680 KB Output is correct
29 Correct 45 ms 740 KB Output is correct
30 Correct 2 ms 740 KB Output is correct
31 Execution timed out 1073 ms 740 KB Time limit exceeded
32 Halted 0 ms 0 KB -