oj.uz

Submission #93024

# Submission time Handle Problem Language Result Execution time Memory
93024 2019-01-06T10:02:31 Z Nodir_Bobiev Bank (IZhO14_bank) C++14
100 / 100
 121 ms 13632 KB 
# include <iostream>
# include <vector>

# define fi first
# define se second

using namespace std;

const int N = (1 << 21);

int n, m, a[30], b[30], s[N],cnt[N];
vector < int > vc[30];

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		a[i] += a[i - 1];
	}
	
	for (int i = 0; i < m; i++)
		cin >> b[i];
	
	for (int j = 0; j < (1 << m); j++)
		vc[__builtin_popcount(j)].push_back(j);
	
	for (int i = 0; i < m; i++){
		//cout << i << endl;
		for (size_t j = 0; j < vc[i].size(); j++){
			int mask = vc[i][j];
			//cout << '\t'<< mask << endl;
			for (int k = 0; k < m; k++){
				if((mask & (1 << k)))
					continue;
				int msk = mask | (1 << k);
				//cout << "\t\t" << msk << endl;
				if(a[cnt[mask] + 1] == s[mask] + b[k]){
					cnt[msk] = max(cnt[msk], cnt[mask] + 1);
					s[msk] = s[mask] + b[k];
				}
				else{
					cnt[msk] = max(cnt[msk], cnt[mask]);
					s[msk] = s[mask] + b[k];
				}
			}
		}
	}
	/*
	for (int i = 0; i < (1 << m); i++){
		cout << cnt[i] << ' ';
	}
	cout << endl;
	*/
	for (int i = 0; i < (1 << m); i++){
		if(cnt[i] == n){
			cout << "YES";
			return 0;
		}
	}
	cout << "NO";
	return 0;
}
/*

1 5
8
4 2 5 1 3

2 6
9 10
5 4 8 6 3 11

*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 732 KB Output is correct
5 Correct 117 ms 13512 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 117 ms 13392 KB Output is correct
9 Correct 117 ms 13516 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 732 KB Output is correct
5 Correct 117 ms 13512 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 117 ms 13392 KB Output is correct
9 Correct 117 ms 13516 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 3 ms 508 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 117 ms 13492 KB Output is correct
32 Correct 121 ms 13504 KB Output is correct
33 Correct 120 ms 13388 KB Output is correct
34 Correct 118 ms 13380 KB Output is correct
35 Correct 118 ms 13524 KB Output is correct
36 Correct 116 ms 13552 KB Output is correct
37 Correct 115 ms 13504 KB Output is correct
38 Correct 118 ms 13380 KB Output is correct
39 Correct 116 ms 13516 KB Output is correct
40 Correct 119 ms 13520 KB Output is correct
41 Correct 118 ms 13588 KB Output is correct
42 Correct 118 ms 13388 KB Output is correct
43 Correct 115 ms 13512 KB Output is correct
44 Correct 110 ms 13504 KB Output is correct
45 Correct 114 ms 13456 KB Output is correct
46 Correct 112 ms 13632 KB Output is correct
47 Correct 112 ms 13388 KB Output is correct
48 Correct 113 ms 13520 KB Output is correct
49 Correct 118 ms 13388 KB Output is correct
50 Correct 116 ms 13384 KB Output is correct
51 Correct 111 ms 13604 KB Output is correct
52 Correct 112 ms 13504 KB Output is correct
53 Correct 119 ms 13504 KB Output is correct
54 Correct 118 ms 13516 KB Output is correct
55 Correct 117 ms 13380 KB Output is correct
56 Correct 117 ms 13388 KB Output is correct
57 Correct 111 ms 13444 KB Output is correct
58 Correct 113 ms 13388 KB Output is correct