oj.uz

Submission #943237

# Submission time Handle Problem Language Result Execution time Memory
943237 2024-03-11T09:34:26 Z mannshah1211 Bank (IZhO14_bank) C++14
52 / 100
 1000 ms 7168 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 j = 0; j < (1 << m); j++) {
			for (int mask : masks[a[i - 1]]) {
				if ((j & mask) == 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
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 70 ms 7168 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Execution timed out 1090 ms 6232 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 70 ms 7168 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Execution timed out 1090 ms 6232 KB Time limit exceeded
9 Halted 0 ms 0 KB -