oj.uz

Submission #831786

# Submission time Handle Problem Language Result Execution time Memory
831786 2023-08-20T14:35:24 Z rainboy Visiting Singapore (NOI20_visitingsingapore) C
100 / 100
 439 ms 588 KB 
#include <stdio.h>

#define N	5000
#define M	5000
#define K	1000
#define INF	0x3f3f3f3f

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

int main() {
	static int aa[N], bb[M], ww[K], dp[M + 1][2][2], dq[M + 1][2][2];
	int n, m, k, a, b, i, j, c, u, v, ans;

	scanf("%d%d%d%d%d", &k, &n, &m, &a, &b);
	for (c = 0; c < k; c++)
		scanf("%d", &ww[c]);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]), aa[i]--;
	for (j = 0; j < m; j++)
		scanf("%d", &bb[j]), bb[j]--;
	for (j = 0; j <= m; j++)
		for (u = 0; u < 2; u++)
			for (v = 0; v < 2; v++)
				dp[j][u][v] = -INF;
	ans = -INF;
	for (i = 0; i <= n; i++) {
		for (j = 0; j <= m; j++)
			for (u = 0; u < 2; u++)
				for (v = 0; v < 2; v++)
					dq[j][u][v] = -INF;
		dp[0][1][1] = max(dp[0][1][1], 0);
		for (j = 0; j <= m; j++)
			for (u = 0; u < 2; u++)
				for (v = 0; v < 2; v++) {
					int x = dp[j][u][v];

					if (x == -INF)
						continue;
					if (i < n)
						dq[j][0][v] = max(dq[j][0][v], x + (u == 1 ? a : 0) + b);
					if (j < m)
						dp[j + 1][u][0] = max(dp[j + 1][u][0], x + (v == 1 ? a : 0) + b);
					if (i < n && j < m && aa[i] == bb[j])
						dq[j + 1][1][1] = max(dq[j + 1][1][1], x + ww[aa[i]]);
				}
		for (u = 0; u < 2; u++)
			for (v = 0; v < 2; v++)
				ans = max(ans, dp[m][u][v]);
		for (j = 0; j <= m; j++)
			for (u = 0; u < 2; u++)
				for (v = 0; v < 2; v++)
					dp[j][u][v] = dq[j][u][v];
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

VisitingSingapore.c: In function 'main':
VisitingSingapore.c:14:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  scanf("%d%d%d%d%d", &k, &n, &m, &a, &b);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
VisitingSingapore.c:16:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d", &ww[c]);
      |   ^~~~~~~~~~~~~~~~~~~
VisitingSingapore.c:18:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d", &aa[i]), aa[i]--;
      |   ^~~~~~~~~~~~~~~~~~~
VisitingSingapore.c:20:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   scanf("%d", &bb[j]), bb[j]--;
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 340 KB Output is correct
2 Correct 13 ms 320 KB Output is correct
3 Correct 105 ms 372 KB Output is correct
4 Correct 233 ms 468 KB Output is correct
5 Correct 72 ms 420 KB Output is correct
6 Correct 103 ms 404 KB Output is correct
7 Correct 192 ms 412 KB Output is correct
8 Correct 63 ms 340 KB Output is correct
9 Correct 126 ms 408 KB Output is correct
10 Correct 290 ms 468 KB Output is correct
11 Correct 290 ms 472 KB Output is correct
12 Correct 293 ms 468 KB Output is correct
13 Correct 282 ms 468 KB Output is correct
14 Correct 385 ms 468 KB Output is correct
15 Correct 384 ms 468 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 340 KB Output is correct
2 Correct 13 ms 320 KB Output is correct
3 Correct 105 ms 372 KB Output is correct
4 Correct 233 ms 468 KB Output is correct
5 Correct 72 ms 420 KB Output is correct
6 Correct 103 ms 404 KB Output is correct
7 Correct 192 ms 412 KB Output is correct
8 Correct 63 ms 340 KB Output is correct
9 Correct 126 ms 408 KB Output is correct
10 Correct 290 ms 468 KB Output is correct
11 Correct 290 ms 472 KB Output is correct
12 Correct 293 ms 468 KB Output is correct
13 Correct 282 ms 468 KB Output is correct
14 Correct 385 ms 468 KB Output is correct
15 Correct 384 ms 468 KB Output is correct
16 Correct 157 ms 408 KB Output is correct
17 Correct 189 ms 444 KB Output is correct
18 Correct 169 ms 340 KB Output is correct
19 Correct 37 ms 340 KB Output is correct
20 Correct 120 ms 420 KB Output is correct
21 Correct 8 ms 212 KB Output is correct
22 Correct 42 ms 432 KB Output is correct
23 Correct 81 ms 420 KB Output is correct
24 Correct 28 ms 340 KB Output is correct
25 Correct 291 ms 500 KB Output is correct
26 Correct 289 ms 468 KB Output is correct
27 Correct 283 ms 492 KB Output is correct
28 Correct 275 ms 488 KB Output is correct
29 Correct 385 ms 480 KB Output is correct
30 Correct 405 ms 484 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 340 KB Output is correct
2 Correct 13 ms 320 KB Output is correct
3 Correct 105 ms 372 KB Output is correct
4 Correct 233 ms 468 KB Output is correct
5 Correct 72 ms 420 KB Output is correct
6 Correct 103 ms 404 KB Output is correct
7 Correct 192 ms 412 KB Output is correct
8 Correct 63 ms 340 KB Output is correct
9 Correct 126 ms 408 KB Output is correct
10 Correct 290 ms 468 KB Output is correct
11 Correct 290 ms 472 KB Output is correct
12 Correct 293 ms 468 KB Output is correct
13 Correct 282 ms 468 KB Output is correct
14 Correct 385 ms 468 KB Output is correct
15 Correct 384 ms 468 KB Output is correct
16 Correct 241 ms 452 KB Output is correct
17 Correct 119 ms 396 KB Output is correct
18 Correct 37 ms 340 KB Output is correct
19 Correct 10 ms 340 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 123 ms 432 KB Output is correct
23 Correct 22 ms 340 KB Output is correct
24 Correct 196 ms 448 KB Output is correct
25 Correct 297 ms 512 KB Output is correct
26 Correct 285 ms 468 KB Output is correct
27 Correct 287 ms 504 KB Output is correct
28 Correct 253 ms 484 KB Output is correct
29 Correct 384 ms 480 KB Output is correct
30 Correct 439 ms 480 KB Output is correct

Subtask #6
13.0 / 13.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 292 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 216 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #7
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 14 ms 336 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 4 ms 308 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 8 ms 212 KB Output is correct
10 Correct 16 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 4 ms 296 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 8 ms 212 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 13 ms 340 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 16 ms 340 KB Output is correct
21 Correct 29 ms 340 KB Output is correct
22 Correct 13 ms 320 KB Output is correct
23 Correct 105 ms 372 KB Output is correct
24 Correct 233 ms 468 KB Output is correct
25 Correct 72 ms 420 KB Output is correct
26 Correct 103 ms 404 KB Output is correct
27 Correct 192 ms 412 KB Output is correct
28 Correct 63 ms 340 KB Output is correct
29 Correct 126 ms 408 KB Output is correct
30 Correct 290 ms 468 KB Output is correct
31 Correct 290 ms 472 KB Output is correct
32 Correct 293 ms 468 KB Output is correct
33 Correct 282 ms 468 KB Output is correct
34 Correct 385 ms 468 KB Output is correct
35 Correct 384 ms 468 KB Output is correct
36 Correct 157 ms 408 KB Output is correct
37 Correct 189 ms 444 KB Output is correct
38 Correct 169 ms 340 KB Output is correct
39 Correct 37 ms 340 KB Output is correct
40 Correct 120 ms 420 KB Output is correct
41 Correct 8 ms 212 KB Output is correct
42 Correct 42 ms 432 KB Output is correct
43 Correct 81 ms 420 KB Output is correct
44 Correct 28 ms 340 KB Output is correct
45 Correct 291 ms 500 KB Output is correct
46 Correct 289 ms 468 KB Output is correct
47 Correct 283 ms 492 KB Output is correct
48 Correct 275 ms 488 KB Output is correct
49 Correct 385 ms 480 KB Output is correct
50 Correct 405 ms 484 KB Output is correct
51 Correct 241 ms 452 KB Output is correct
52 Correct 119 ms 396 KB Output is correct
53 Correct 37 ms 340 KB Output is correct
54 Correct 10 ms 340 KB Output is correct
55 Correct 5 ms 340 KB Output is correct
56 Correct 7 ms 468 KB Output is correct
57 Correct 123 ms 432 KB Output is correct
58 Correct 22 ms 340 KB Output is correct
59 Correct 196 ms 448 KB Output is correct
60 Correct 297 ms 512 KB Output is correct
61 Correct 285 ms 468 KB Output is correct
62 Correct 287 ms 504 KB Output is correct
63 Correct 253 ms 484 KB Output is correct
64 Correct 384 ms 480 KB Output is correct
65 Correct 439 ms 480 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 292 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 216 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 296 KB Output is correct
76 Correct 0 ms 288 KB Output is correct
77 Correct 0 ms 288 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 1 ms 212 KB Output is correct
81 Correct 244 ms 484 KB Output is correct
82 Correct 57 ms 368 KB Output is correct
83 Correct 116 ms 440 KB Output is correct
84 Correct 61 ms 340 KB Output is correct
85 Correct 95 ms 404 KB Output is correct
86 Correct 81 ms 388 KB Output is correct
87 Correct 15 ms 360 KB Output is correct
88 Correct 9 ms 296 KB Output is correct
89 Correct 32 ms 340 KB Output is correct
90 Correct 333 ms 484 KB Output is correct
91 Correct 285 ms 496 KB Output is correct
92 Correct 285 ms 468 KB Output is correct
93 Correct 292 ms 504 KB Output is correct
94 Correct 288 ms 504 KB Output is correct
95 Correct 247 ms 484 KB Output is correct
96 Correct 283 ms 436 KB Output is correct
97 Correct 297 ms 492 KB Output is correct
98 Correct 390 ms 480 KB Output is correct
99 Correct 402 ms 588 KB Output is correct
100 Correct 382 ms 484 KB Output is correct