Submission #93042

# Submission time Handle Problem Language Result Execution time Memory
93042 2019-01-06T10:15:04 Z Nodir_Bobiev Bank (IZhO14_bank) C++14
100 / 100
146 ms 13548 KB
// solved by bitmask

# include <iostream>
# include <vector>

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()
{
	ios_base::sync_with_stdio(false);
	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++){
		for(auto mask: vc[i]){
			for (int k = 0; k < m; k++){
				if((mask & (1 << k)))continue;

				int msk = mask | (1 << k);
				
				s[msk] = s[mask] + b[k];
				
				if(a[cnt[mask] + 1] == s[mask] + b[k])
					cnt[msk] = max(cnt[msk], cnt[mask] + 1);
				
				else
					cnt[msk] = max(cnt[msk], cnt[mask]);
				
				if(cnt[msk] == n){
					cout << "YES";
					exit(0);
				}
			}
		}
	}
	cout << "NO";
	return 0;
}
/*

1 5
8
4 2 5 1 3

2 6
9 10
5 4 8 6 3 11

*/
# 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 636 KB Output is correct
5 Correct 132 ms 13492 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 22 ms 12104 KB Output is correct
9 Correct 132 ms 13452 KB Output is correct
# 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
# 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 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
# 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 636 KB Output is correct
5 Correct 132 ms 13492 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 22 ms 12104 KB Output is correct
9 Correct 132 ms 13452 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 636 KB Output is correct
25 Correct 3 ms 632 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 504 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 134 ms 13484 KB Output is correct
32 Correct 138 ms 13444 KB Output is correct
33 Correct 133 ms 13512 KB Output is correct
34 Correct 132 ms 13452 KB Output is correct
35 Correct 126 ms 13440 KB Output is correct
36 Correct 130 ms 13492 KB Output is correct
37 Correct 132 ms 13412 KB Output is correct
38 Correct 133 ms 13528 KB Output is correct
39 Correct 29 ms 13004 KB Output is correct
40 Correct 133 ms 13432 KB Output is correct
41 Correct 134 ms 13464 KB Output is correct
42 Correct 133 ms 13544 KB Output is correct
43 Correct 134 ms 13504 KB Output is correct
44 Correct 134 ms 13492 KB Output is correct
45 Correct 24 ms 12036 KB Output is correct
46 Correct 130 ms 13548 KB Output is correct
47 Correct 131 ms 13472 KB Output is correct
48 Correct 16 ms 8400 KB Output is correct
49 Correct 134 ms 13492 KB Output is correct
50 Correct 134 ms 13524 KB Output is correct
51 Correct 127 ms 13492 KB Output is correct
52 Correct 131 ms 13464 KB Output is correct
53 Correct 138 ms 13532 KB Output is correct
54 Correct 143 ms 13492 KB Output is correct
55 Correct 145 ms 13532 KB Output is correct
56 Correct 136 ms 13492 KB Output is correct
57 Correct 135 ms 13456 KB Output is correct
58 Correct 146 ms 13492 KB Output is correct