oj.uz

Submission #798851

# Submission time Handle Problem Language Result Execution time Memory
798851 2023-07-31T05:36:27 Z SanguineChameleon Bank (IZhO14_bank) C++17
71 / 100
 57 ms 6640 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxN = 20;
const int maxA = 1e3 + 20;
int A[maxN];
int B[maxN];
vector<int> masks[maxA];
bool flag[maxN][1 << maxN];
int N, M;

void backtrack(int pos, int cur) {
	if (flag[pos][cur]) {
		return;
	}
	flag[pos][cur] = true;
	if (pos == N) {
		cout << "YES";
		exit(0);
	}
	for (auto mask: masks[A[pos]]) {
		if (!(cur & mask)) {
			backtrack(pos + 1, cur | mask);
		}
	}
}

int main() {
	cin >> N >> M;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	for (int i = 0; i < M; i++) {
		cin >> B[i];
	}
	for (int mask = 0; mask < (1 << M); mask++) {
		int sum = 0;
		for (int i = 0; i < M; i++) {
			if ((mask >> i) & 1) {
				sum += B[i];
			}
		}
		if (sum < maxA) {
			masks[sum].push_back(mask);
		}
	}
	backtrack(0, 0);
	cout << "NO";
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 51 ms 6640 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 51 ms 5796 KB Output is correct
9 Correct 51 ms 6228 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 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 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 460 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 51 ms 6640 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 51 ms 5796 KB Output is correct
9 Correct 51 ms 6228 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 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 1 ms 460 KB Output is correct
24 Correct 1 ms 452 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 57 ms 5848 KB Output is correct
32 Correct 54 ms 6072 KB Output is correct
33 Correct 47 ms 1092 KB Output is correct
34 Correct 46 ms 332 KB Output is correct
35 Correct 46 ms 328 KB Output is correct
36 Runtime error 47 ms 580 KB Execution killed with signal 11
37 Halted 0 ms 0 KB -