oj.uz

Submission #68583

# Submission time Handle Problem Language Result Execution time Memory
68583 2018-08-17T12:16:31 Z cdemirer Bank (IZhO14_bank) C++17
100 / 100
 366 ms 9208 KB 
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef pair<double, double> dodo;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)


int N, M;
int A[20], B[20];

vi masklist[20001];
bool mark[1048576];

void dfs(int pos, int mask) {
	
}

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(0);
	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];
	for (int j = 1; j < (1<<M); j++) {
		int sum = 0;
		for (int k = 0; k < M; k++) if (j & (1<<k)) sum += B[k];
		masklist[sum].pb(j);
	}
	int sum = 0;
	vi masks;
	for (int i = 0; i < N; i++) {
		sum += A[i];
		masks.clear();
		for (int j = 0; j < masklist[sum].size(); j++) {
			int m = masklist[sum][j];
			if (i == 0 || mark[m]) masks.pb(m);
		}
		if (masks.empty()) {
			cout << "NO" << endl;
			return 0;
		}
		memset(mark, 0, sizeof(mark));
		for (int i = 0; i < masks.size(); i++) {
			int m = masks[i];
			mark[m] = true;
		}
		for (int m = 0; m < (1<<M); m++) {
			if (mark[m]) for (int k = 0; k < M; k++) {
				mark[m | (1<<k)] = true;
			}
		}
	}
	cout << "YES" << endl;
	return 0;
}

Compilation message

bank.cpp: In function 'int main(int, char**)':
bank.cpp:42:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < masklist[sum].size(); j++) {
                   ~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:51:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < masks.size(); i++) {
                   ~~^~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1784 KB Output is correct
2 Correct 2 ms 1784 KB Output is correct
3 Correct 3 ms 1856 KB Output is correct
4 Correct 5 ms 2128 KB Output is correct
5 Correct 77 ms 7140 KB Output is correct
6 Correct 2 ms 7140 KB Output is correct
7 Correct 3 ms 7140 KB Output is correct
8 Correct 91 ms 7636 KB Output is correct
9 Correct 75 ms 7636 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7636 KB Output is correct
2 Correct 3 ms 7636 KB Output is correct
3 Correct 3 ms 7636 KB Output is correct
4 Correct 3 ms 7636 KB Output is correct
5 Correct 3 ms 7636 KB Output is correct
6 Correct 3 ms 7636 KB Output is correct
7 Correct 3 ms 7636 KB Output is correct
8 Correct 3 ms 7636 KB Output is correct
9 Correct 3 ms 7636 KB Output is correct
10 Correct 3 ms 7636 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1784 KB Output is correct
2 Correct 2 ms 1784 KB Output is correct
3 Correct 3 ms 1856 KB Output is correct
4 Correct 5 ms 2128 KB Output is correct
5 Correct 77 ms 7140 KB Output is correct
6 Correct 2 ms 7140 KB Output is correct
7 Correct 3 ms 7140 KB Output is correct
8 Correct 91 ms 7636 KB Output is correct
9 Correct 75 ms 7636 KB Output is correct
10 Correct 3 ms 7636 KB Output is correct
11 Correct 3 ms 7636 KB Output is correct
12 Correct 3 ms 7636 KB Output is correct
13 Correct 3 ms 7636 KB Output is correct
14 Correct 3 ms 7636 KB Output is correct
15 Correct 3 ms 7636 KB Output is correct
16 Correct 3 ms 7636 KB Output is correct
17 Correct 3 ms 7636 KB Output is correct
18 Correct 3 ms 7636 KB Output is correct
19 Correct 3 ms 7636 KB Output is correct
20 Correct 5 ms 7636 KB Output is correct
21 Correct 5 ms 7636 KB Output is correct
22 Correct 5 ms 7636 KB Output is correct
23 Correct 3 ms 7636 KB Output is correct
24 Correct 4 ms 7636 KB Output is correct
25 Correct 3 ms 7636 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 5 ms 7636 KB Output is correct
29 Correct 5 ms 7636 KB Output is correct
30 Correct 3 ms 7636 KB Output is correct
31 Correct 92 ms 8456 KB Output is correct
32 Correct 101 ms 8456 KB Output is correct
33 Correct 110 ms 8456 KB Output is correct
34 Correct 115 ms 8456 KB Output is correct
35 Correct 122 ms 9084 KB Output is correct
36 Correct 126 ms 9084 KB Output is correct
37 Correct 94 ms 9208 KB Output is correct
38 Correct 82 ms 9208 KB Output is correct
39 Correct 328 ms 9208 KB Output is correct
40 Correct 87 ms 9208 KB Output is correct
41 Correct 87 ms 9208 KB Output is correct
42 Correct 125 ms 9208 KB Output is correct
43 Correct 103 ms 9208 KB Output is correct
44 Correct 86 ms 9208 KB Output is correct
45 Correct 129 ms 9208 KB Output is correct
46 Correct 116 ms 9208 KB Output is correct
47 Correct 112 ms 9208 KB Output is correct
48 Correct 102 ms 9208 KB Output is correct
49 Correct 76 ms 9208 KB Output is correct
50 Correct 338 ms 9208 KB Output is correct
51 Correct 142 ms 9208 KB Output is correct
52 Correct 179 ms 9208 KB Output is correct
53 Correct 178 ms 9208 KB Output is correct
54 Correct 352 ms 9208 KB Output is correct
55 Correct 339 ms 9208 KB Output is correct
56 Correct 366 ms 9208 KB Output is correct
57 Correct 340 ms 9208 KB Output is correct
58 Correct 335 ms 9208 KB Output is correct