답안 #3333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
3333	2013-08-30T12:16:10 Z	mjy0503	일도양단! (kriii1_1)	C++	1 / 1	4 ms	1772 KB

1

#include <stdio.h>
#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a>b)?a:b)
int n,m,h,kk;
bool map[7][7][7];
int tbl[7][8][7][8][7][8];
int back(int r1,int r2,int c1,int c2,int h1,int h2){
	int i,j,k,cnt=0;
	if(tbl[r1][r2][c1][c2][h1][h2]!=0)
		return tbl[r1][r2][c1][c2][h1][h2];
	for(i=r1;i<r2;i++){
		for(j=c1;j<c2;j++){
			for(k=h1;k<h2;k++){
				if(map[i][j][k])
					cnt++;
			}
		}
	}
	if(cnt==1){
		tbl[r1][r2][c1][c2][h1][h2]=(r2-r1)*(c2-c1)*(h2-h1);
		return (r2-r1)*(c2-c1)*(h2-h1);
	}
	if(cnt==0){
		tbl[r1][r2][c1][c2][h1][h2]=-1;
		return -1;
	}
	int ans=-1;
	for(i=r1+1;i<r2;i++)
		ans=max(ans,min(back(r1,i,c1,c2,h1,h2),back(i,r2,c1,c2,h1,h2)));
	for(i=c1+1;i<c2;i++)
		ans=max(ans,min(back(r1,r2,c1,i,h1,h2),back(r1,r2,i,c2,h1,h2)));
	for(i=h1+1;i<h2;i++)
		ans=max(ans,min(back(r1,r2,c1,c2,h1,i),back(r1,r2,c1,c2,i,h2)));
	tbl[r1][r2][c1][c2][h1][h2]=ans;
	return ans;
}
int main(){
	int i,a,b,c;
	scanf("%d %d %d %d",&n,&m,&h,&kk);
	for(i=0;i<kk;i++){
		scanf("%d %d %d",&a,&b,&c);
		a--;b--;c--;
		map[a][b][c]=1;
	}
	printf("%d\n",back(0,n,0,m,0,h));
	return 0;
}

Subtask #1

1.0 / 1.0

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