oj.uz

답안 #706488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
706488 2023-03-06T17:46:14 Z rainboy Growing Vegetable is Fun 3 (JOI19_ho_t3) C
100 / 100
 39 ms 28724 KB 
#include <stdio.h>
#include <string.h>

#define N	400
#define M	(1 << 23)
#define INF	0x3f3f3f3f

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }

int main() {
	static char cc[N + 1];
	static int kk[3][3][N], dp[M];
	int n, i, nr, ng, ny, kr, kg, ky, c, u, v, x, ans;

	scanf("%d%s", &n, cc);
	nr = ng = ny = 0;
	for (i = 0; i < n; i++)
		if (cc[i] == 'R')
			kk[0][1][nr] = ng, kk[0][2][nr] = ny, nr++;
		else if (cc[i] == 'G')
			kk[1][2][ng] = ny, kk[1][0][ng] = nr, ng++;
		else
			kk[2][0][ny] = nr, kk[2][1][ny] = ng, ny++;
	memset(dp, 0x3f, (nr + 1) * (ng + 1) * (ny + 1) * 3 * sizeof *dp);
	for (c = 0; c < 3; c++) {
		u = ((0 * (ng + 1) + 0) * (ny + 1) + 0) * 3 + c;
		dp[u] = 0;
	}
	for (kr = 0; kr <= nr; kr++)
		for (kg = 0; kg <= ng; kg++)
			for (ky = 0; ky <= ny; ky++)
				for (c = 0; c < 3; c++) {
					u = ((kr * (ng + 1) + kg) * (ny + 1) + ky) * 3 + c, x = dp[u];
					if (x == INF)
						continue;
					if (kr < nr && c != 0) {
						v = (((kr + 1) * (ng + 1) + kg) * (ny + 1) + ky) * 3 + 0;
						dp[v] = min(dp[v], x + abs_(kk[0][1][kr] - kg) + abs_(kk[0][2][kr] - ky));
					}
					if (kg < ng && c != 1) {
						v = ((kr * (ng + 1) + (kg + 1)) * (ny + 1) + ky) * 3 + 1;
						dp[v] = min(dp[v], x + abs_(kk[1][2][kg] - ky) + abs_(kk[1][0][kg] - kr));
					}
					if (ky < ny && c != 2) {
						v = ((kr * (ng + 1) + kg) * (ny + 1) + (ky + 1)) * 3 + 2;
						dp[v] = min(dp[v], x + abs_(kk[2][0][ky] - kr) + abs_(kk[2][1][ky] - kg));
					}
				}
	ans = INF;
	for (c = 0; c < 3; c++) {
		u = ((nr * (ng + 1) + ng) * (ny + 1) + ny) * 3 + c;
		if (dp[u] != INF)
			ans = min(ans, dp[u] / 2);
	}
	if (ans == INF)
		ans = -1;
	printf("%d\n", ans);
	return 0;
}

Compilation message

joi2019_ho_t3.c: In function 'main':
joi2019_ho_t3.c:16:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d%s", &n, cc);
      |  ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 288 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 288 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 292 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 300 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 680 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 680 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 676 KB Output is correct
16 Correct 1 ms 724 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 288 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 292 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 300 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 1 ms 724 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 1 ms 724 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 680 KB Output is correct
50 Correct 1 ms 724 KB Output is correct
51 Correct 1 ms 724 KB Output is correct
52 Correct 1 ms 680 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 676 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 33 ms 28372 KB Output is correct
59 Correct 34 ms 28372 KB Output is correct
60 Correct 34 ms 28232 KB Output is correct
61 Correct 34 ms 28500 KB Output is correct
62 Correct 2 ms 2516 KB Output is correct
63 Correct 3 ms 4424 KB Output is correct
64 Correct 13 ms 14220 KB Output is correct
65 Correct 23 ms 20248 KB Output is correct
66 Correct 34 ms 28116 KB Output is correct
67 Correct 36 ms 28096 KB Output is correct
68 Correct 39 ms 28516 KB Output is correct
69 Correct 36 ms 28724 KB Output is correct
70 Correct 35 ms 28584 KB Output is correct
71 Correct 33 ms 27880 KB Output is correct
72 Correct 6 ms 7380 KB Output is correct
73 Correct 2 ms 2088 KB Output is correct