oj.uz

답안 #943261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943261 2024-03-11T09:44:40 Z mannshah1211 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 7768 KB 
/**
 *   author: hashman
 *   created: 
**/
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif

int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int> a(n), b(m);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}
	vector<vector<int>> masks(1001);
	for (int i = 0; i < (1 << m); i++) {
		int sum = 0;
		for (int j = 0; j < m; j++) {
			if (i & (1 << j)) sum += b[j];
		}
		if (sum <= 1000) masks[sum].push_back(i);
	}
	vector<vector<bool>> dp(n + 1, vector<bool>((1 << m)));
	for (int i = 0; i < (1 << m); i++) {
		dp[0][i] = true;
	}
	for (int i = 1; i <= n; i++) {
		for (int mask : masks[a[i - 1]]) {
			for (int j = mask; j < (1 << m); j = (j + 1) | mask) {
				dp[i][j] = dp[i][j] || dp[i - 1][j ^ mask];
			}
		}
	}
	if (dp[n][(1 << m) - 1]) cout << "YES\n";
	else cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 54 ms 7240 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 71 ms 6224 KB Output is correct
9 Correct 53 ms 6632 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 54 ms 7240 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 71 ms 6224 KB Output is correct
9 Correct 53 ms 6632 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 67 ms 6232 KB Output is correct
32 Correct 231 ms 6900 KB Output is correct
33 Correct 72 ms 2384 KB Output is correct
34 Correct 60 ms 2000 KB Output is correct
35 Correct 63 ms 2132 KB Output is correct
36 Correct 76 ms 3280 KB Output is correct
37 Correct 51 ms 1104 KB Output is correct
38 Correct 49 ms 1364 KB Output is correct
39 Correct 230 ms 6308 KB Output is correct
40 Correct 58 ms 3540 KB Output is correct
41 Correct 61 ms 3664 KB Output is correct
42 Correct 177 ms 6996 KB Output is correct
43 Correct 78 ms 3408 KB Output is correct
44 Correct 65 ms 2640 KB Output is correct
45 Correct 108 ms 6992 KB Output is correct
46 Correct 90 ms 4432 KB Output is correct
47 Correct 66 ms 2528 KB Output is correct
48 Correct 88 ms 6408 KB Output is correct
49 Correct 52 ms 6508 KB Output is correct
50 Correct 651 ms 7604 KB Output is correct
51 Correct 359 ms 7768 KB Output is correct
52 Correct 795 ms 6628 KB Output is correct
53 Execution timed out 1046 ms 6552 KB Time limit exceeded
54 Halted 0 ms 0 KB -