oj.uz

Submission #566659

# Submission time Handle Problem Language Result Execution time Memory
566659 2022-05-22T14:30:16 Z racsosabe Bank (IZhO14_bank) C++14
100 / 100
 603 ms 70088 KB 
#include<bits/stdc++.h>
using namespace::std;

const int N = 20 + 5;
const int MASK = 1 << 20;

int n;
int m;
int neg;
int a[N];
int b[N];
int total;
int sum[MASK];
int memo[N][MASK];

void preprocess(){
	for(int mask = 1, l = 1 << m; mask < l; mask++) sum[mask] = sum[mask & (mask - 1)] + b[__builtin_ctz(mask)];
}

bool solve(){
	for(int pos = n - 1; pos >= 0; pos--){
		for(int mask = total; mask >= 0; mask--){
			if(__builtin_popcount(mask) < pos) continue;
			int &ans = memo[pos][mask];
			for(int m = mask ^ total; m > 0; m &= m - 1){
				int to = __builtin_ctz(m);
				int p = m & (-m);
				int new_mask = mask | p;
				if(sum[new_mask] == a[pos]) ans = max(ans, 1 + memo[pos + 1][new_mask]);
				else ans = max(ans, memo[pos][new_mask]);
			}
		}
	}
	return memo[0][0] == n;
}

int main(){
	scanf("%d %d", &n, &m);
	total = (1 << m) - 1;
	for(int i = 0; i < n; i++) scanf("%d", a + i);
	for(int i = 0; i < m; i++) scanf("%d", b + i);
	sort(a, a + n);
	for(int i = 1; i < n; i++) a[i] += a[i - 1];
	preprocess();
	puts(solve() ? "YES" : "NO");
	return 0;
}

Compilation message

bank.cpp: In function 'bool solve()':
bank.cpp:26:9: warning: unused variable 'to' [-Wunused-variable]
   26 |     int to = __builtin_ctz(m);
      |         ^~
bank.cpp: In function 'int main()':
bank.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  scanf("%d %d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:40:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  for(int i = 0; i < n; i++) scanf("%d", a + i);
      |                             ~~~~~^~~~~~~~~~~~~
bank.cpp:41:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  for(int i = 0; i < m; i++) scanf("%d", b + i);
      |                             ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 53 ms 8392 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 62 ms 8400 KB Output is correct
9 Correct 52 ms 8508 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 4 ms 1236 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 5 ms 1236 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 53 ms 8392 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 62 ms 8400 KB Output is correct
9 Correct 52 ms 8508 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 4 ms 980 KB Output is correct
23 Correct 4 ms 1236 KB Output is correct
24 Correct 4 ms 980 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 4 ms 852 KB Output is correct
29 Correct 3 ms 852 KB Output is correct
30 Correct 5 ms 1236 KB Output is correct
31 Correct 117 ms 12576 KB Output is correct
32 Correct 159 ms 16724 KB Output is correct
33 Correct 326 ms 33156 KB Output is correct
34 Correct 447 ms 45336 KB Output is correct
35 Correct 474 ms 49460 KB Output is correct
36 Correct 526 ms 69972 KB Output is correct
37 Correct 99 ms 12552 KB Output is correct
38 Correct 185 ms 20696 KB Output is correct
39 Correct 396 ms 37116 KB Output is correct
40 Correct 414 ms 45416 KB Output is correct
41 Correct 544 ms 70060 KB Output is correct
42 Correct 233 ms 24864 KB Output is correct
43 Correct 390 ms 37172 KB Output is correct
44 Correct 497 ms 65020 KB Output is correct
45 Correct 141 ms 16644 KB Output is correct
46 Correct 295 ms 28920 KB Output is correct
47 Correct 501 ms 65016 KB Output is correct
48 Correct 50 ms 8448 KB Output is correct
49 Correct 47 ms 8396 KB Output is correct
50 Correct 603 ms 70052 KB Output is correct
51 Correct 445 ms 45408 KB Output is correct
52 Correct 473 ms 45428 KB Output is correct
53 Correct 489 ms 45444 KB Output is correct
54 Correct 517 ms 70020 KB Output is correct
55 Correct 552 ms 70088 KB Output is correct
56 Correct 587 ms 69976 KB Output is correct
57 Correct 513 ms 69996 KB Output is correct
58 Correct 553 ms 69960 KB Output is correct