Submission #3346

# Submission time Handle Problem Language Result Execution time Memory
3346 2013-08-30T13:20:53 Z movie_jo 일도양단! (kriii1_1) C
1 / 1
4 ms 1548 KB
#include <stdio.h>

int x[7][7][7];
int save[7][7][7][7][7][7];

int f(int a, int b, int c, int R, int C, int H)
{
	int i, j, k, S = 0, w, y, z, M = -1;

	if(save[a][b][c][R][C][H])
		return save[a][b][c][R][C][H];

	for(i = 0; i < R; i++)for(j = 0; j < C; j++)for(k = 0; k < H; k++)
		if(x[a + i][b + j][c + k])
			S++;

	if(S == 0)
		return 0;
	else if(S == 1)
		return R*C*H;

	for(i = 1; i < R; i++)
	{
		y = f(a + i, b, c, R - i, C, H);

		if(y == -1)
			break;

		w = f(a, b, c, i, C, H);
		
		z = w > y ? y : w;

		if(z > M)
			M = z;
	}

	for(i = 1; i < C; i++)
	{
		y = f(a, b + i, c, R, C - i, H);

		if(y == -1)
			break;

		w = f(a, b, c, R, i, H);
		
		z = w > y ? y : w;

		if(z > M)
			M = z;
	}

	for(i = 1; i < H; i++)
	{
		y = f(a, b, c + i, R, C, H - i);

		if(y == -1)
			break;

		w = f(a, b, c, R, C, i);

		z = w > y ? y : w;

		if(z > M)
			M = z;
	}

	save[a][b][c][R][C][H] = M;
	return M;
}

int main(void)
{
	int R, C, H, N, i, a, b, c;

	scanf("%d %d %d %d", &R, &C, &H, &N);

	for(i = 0; i < N; i++)
	{
		scanf("%d %d %d", &a, &b, &c);

		x[a - 1][b - 1][c - 1] = 1;
	}

	printf("%d\n", f(0, 0, 0, R, C, H));

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1548 KB Output is correct
2 Correct 0 ms 1548 KB Output is correct
3 Correct 0 ms 1548 KB Output is correct
4 Correct 0 ms 1548 KB Output is correct
5 Correct 0 ms 1548 KB Output is correct
6 Correct 0 ms 1548 KB Output is correct
7 Correct 0 ms 1548 KB Output is correct
8 Correct 0 ms 1548 KB Output is correct
9 Correct 0 ms 1548 KB Output is correct
10 Correct 0 ms 1548 KB Output is correct
11 Correct 0 ms 1548 KB Output is correct
12 Correct 0 ms 1548 KB Output is correct
13 Correct 0 ms 1548 KB Output is correct
14 Correct 0 ms 1548 KB Output is correct
15 Correct 0 ms 1548 KB Output is correct
16 Correct 0 ms 1548 KB Output is correct
17 Correct 0 ms 1548 KB Output is correct
18 Correct 0 ms 1548 KB Output is correct
19 Correct 0 ms 1548 KB Output is correct
20 Correct 0 ms 1548 KB Output is correct
21 Correct 0 ms 1548 KB Output is correct
22 Correct 0 ms 1548 KB Output is correct
23 Correct 0 ms 1548 KB Output is correct
24 Correct 0 ms 1548 KB Output is correct
25 Correct 0 ms 1548 KB Output is correct
26 Correct 0 ms 1548 KB Output is correct
27 Correct 0 ms 1548 KB Output is correct
28 Correct 0 ms 1548 KB Output is correct
29 Correct 0 ms 1548 KB Output is correct
30 Correct 0 ms 1548 KB Output is correct
31 Correct 0 ms 1548 KB Output is correct
32 Correct 0 ms 1548 KB Output is correct
33 Correct 0 ms 1548 KB Output is correct
34 Correct 0 ms 1548 KB Output is correct
35 Correct 0 ms 1548 KB Output is correct
36 Correct 0 ms 1548 KB Output is correct
37 Correct 0 ms 1548 KB Output is correct
38 Correct 0 ms 1548 KB Output is correct
39 Correct 0 ms 1548 KB Output is correct
40 Correct 0 ms 1548 KB Output is correct
41 Correct 0 ms 1548 KB Output is correct
42 Correct 0 ms 1548 KB Output is correct
43 Correct 0 ms 1548 KB Output is correct
44 Correct 0 ms 1548 KB Output is correct
45 Correct 0 ms 1548 KB Output is correct
46 Correct 0 ms 1548 KB Output is correct
47 Correct 0 ms 1548 KB Output is correct
48 Correct 0 ms 1548 KB Output is correct
49 Correct 0 ms 1548 KB Output is correct
50 Correct 0 ms 1548 KB Output is correct
51 Correct 0 ms 1548 KB Output is correct
52 Correct 0 ms 1548 KB Output is correct
53 Correct 0 ms 1548 KB Output is correct
54 Correct 0 ms 1548 KB Output is correct
55 Correct 0 ms 1548 KB Output is correct
56 Correct 0 ms 1548 KB Output is correct
57 Correct 0 ms 1548 KB Output is correct
58 Correct 0 ms 1548 KB Output is correct
59 Correct 0 ms 1548 KB Output is correct
60 Correct 0 ms 1548 KB Output is correct
61 Correct 0 ms 1548 KB Output is correct
62 Correct 0 ms 1548 KB Output is correct
63 Correct 0 ms 1548 KB Output is correct
64 Correct 0 ms 1548 KB Output is correct
65 Correct 0 ms 1548 KB Output is correct
66 Correct 0 ms 1548 KB Output is correct
67 Correct 0 ms 1548 KB Output is correct
68 Correct 0 ms 1548 KB Output is correct
69 Correct 0 ms 1548 KB Output is correct
70 Correct 0 ms 1548 KB Output is correct
71 Correct 0 ms 1548 KB Output is correct
72 Correct 0 ms 1548 KB Output is correct
73 Correct 0 ms 1548 KB Output is correct
74 Correct 0 ms 1548 KB Output is correct
75 Correct 0 ms 1548 KB Output is correct
76 Correct 0 ms 1548 KB Output is correct
77 Correct 0 ms 1548 KB Output is correct
78 Correct 0 ms 1548 KB Output is correct
79 Correct 0 ms 1548 KB Output is correct
80 Correct 0 ms 1548 KB Output is correct
81 Correct 0 ms 1548 KB Output is correct
82 Correct 0 ms 1548 KB Output is correct
83 Correct 0 ms 1548 KB Output is correct
84 Correct 0 ms 1548 KB Output is correct
85 Correct 0 ms 1548 KB Output is correct
86 Correct 0 ms 1548 KB Output is correct
87 Correct 0 ms 1548 KB Output is correct
88 Correct 0 ms 1548 KB Output is correct
89 Correct 0 ms 1548 KB Output is correct
90 Correct 0 ms 1548 KB Output is correct
91 Correct 0 ms 1548 KB Output is correct
92 Correct 0 ms 1548 KB Output is correct
93 Correct 0 ms 1548 KB Output is correct
94 Correct 0 ms 1548 KB Output is correct
95 Correct 0 ms 1548 KB Output is correct
96 Correct 0 ms 1548 KB Output is correct
97 Correct 0 ms 1548 KB Output is correct
98 Correct 0 ms 1548 KB Output is correct
99 Correct 4 ms 1548 KB Output is correct
100 Correct 0 ms 1548 KB Output is correct