oj.uz

Submission #767283

# Submission time Handle Problem Language Result Execution time Memory
767283 2023-06-26T15:00:41 Z rainboy Bank (IZhO14_bank) C
100 / 100
 88 ms 8476 KB 
#include <stdio.h>

#define N	20
#define M	20

int max(int a, int b) { return a > b ? a : b; }

int main() {
	static int aa[N], ss[1 << M], dp[1 << M];
	int n, m, i, j, b;

	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 1; i < n; i++)
		aa[i] += aa[i - 1];
	for (j = 0; j < m; j++)
		scanf("%d", &ss[1 << j]);
	for (b = 1; b < 1 << m; b++)
		ss[b] = ss[b & b - 1] + ss[b & -b];
	for (b = 1; b < 1 << m; b++) {
		for (j = 0; j < m; j++)
			if ((b & 1 << j) != 0)
				dp[b] = max(dp[b], dp[b ^ 1 << j]);
		for (i = 0; i < n; i++)
			if (ss[b] == aa[i]) {
				dp[b]++;
				break;
			}
	}
	printf(dp[(1 << m) - 1] == n ? "YES\n" : "NO\n");
	return 0;
}

Compilation message

bank.c: In function 'main':
bank.c:20:20: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   20 |   ss[b] = ss[b & b - 1] + ss[b & -b];
      |                  ~~^~~
bank.c:12:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
bank.c:14:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
bank.c:18:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d", &ss[1 << j]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 71 ms 8380 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 78 ms 8436 KB Output is correct
9 Correct 73 ms 8448 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 71 ms 8380 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 78 ms 8436 KB Output is correct
9 Correct 73 ms 8448 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 292 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 416 KB Output is correct
21 Correct 2 ms 420 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 416 KB Output is correct
24 Correct 1 ms 416 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 420 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 72 ms 8380 KB Output is correct
32 Correct 70 ms 8396 KB Output is correct
33 Correct 74 ms 8468 KB Output is correct
34 Correct 74 ms 8476 KB Output is correct
35 Correct 75 ms 8368 KB Output is correct
36 Correct 88 ms 8464 KB Output is correct
37 Correct 70 ms 8384 KB Output is correct
38 Correct 76 ms 8384 KB Output is correct
39 Correct 68 ms 8408 KB Output is correct
40 Correct 74 ms 8464 KB Output is correct
41 Correct 86 ms 8388 KB Output is correct
42 Correct 72 ms 8468 KB Output is correct
43 Correct 74 ms 8392 KB Output is correct
44 Correct 88 ms 8460 KB Output is correct
45 Correct 70 ms 8436 KB Output is correct
46 Correct 74 ms 8412 KB Output is correct
47 Correct 82 ms 8464 KB Output is correct
48 Correct 68 ms 8396 KB Output is correct
49 Correct 70 ms 8408 KB Output is correct
50 Correct 70 ms 8364 KB Output is correct
51 Correct 74 ms 8464 KB Output is correct
52 Correct 71 ms 8408 KB Output is correct
53 Correct 68 ms 8396 KB Output is correct
54 Correct 70 ms 8356 KB Output is correct
55 Correct 69 ms 8420 KB Output is correct
56 Correct 70 ms 8396 KB Output is correct
57 Correct 69 ms 8412 KB Output is correct
58 Correct 75 ms 8392 KB Output is correct