oj.uz

답안 #5163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
5163 2014-02-13T13:58:39 Z cki86201 일도양단! (kriii1_1) C++
1 / 1
 0 ms 2112 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;

int d[8][8][8][8][8][8];
int p[8][8][8];

#define rep(i,a,b) for(int i=a;i<=b;i++)
#define get(x1,x2,y1,y2,z1,z2) (p[x2][y2][z2]-p[x2][y2][z1-1]-p[x2][y1-1][z2]-p[x1-1][y2][z2]+p[x2][y1-1][z1-1]+p[x1-1][y2][z1-1]+p[x1-1][y1-1][z2]-p[x1-1][y1-1][z1-1])

int main()
{
	int R, C, H, q;
	scanf("%d%d%d%d",&R,&C,&H,&q);
	while(q--){
		int x, y, z;
		scanf("%d%d%d",&x,&y,&z);
		p[x][y][z] = 1;
	}
	rep(i,1,R)rep(j,1,C)rep(k,1,H){
		p[i][j][k] += p[i][j][k-1] + p[i][j-1][k] + p[i-1][j][k] - p[i-1][j-1][k] - p[i-1][j][k-1] - p[i][j-1][k-1] + p[i-1][j-1][k-1];
	}
	rep(i,0,R-1)rep(j,1,R-i)rep(k,0,C-1)rep(m,1,C-k)rep(n,0,H-1)rep(l,1,H-n){
		int tmp = get(j,j+i,m,m+k,l,l+n);
		if(tmp == 1)d[j][j+i][m][m+k][l][l+n] = (i+1)*(k+1)*(n+1);
		else if(tmp > 1){
			int u = 0;
			rep(t,j,j+i-1){
				int a = d[j][t][m][m+k][l][l+n];
				int b = d[t+1][j+i][m][m+k][l][l+n];
				if(!a || !b)continue;
				u = max(u, min(a,b));
			}
			rep(t,m,m+k-1){
				int a = d[j][j+i][m][t][l][l+n];
				int b = d[j][j+i][t+1][m+k][l][l+n];
				if(!a || !b)continue;
				u = max(u, min(a,b));
			}
			rep(t,l,l+n-1){
				int a = d[j][j+i][m][m+k][l][t];
				int b = d[j][j+i][m][m+k][t+1][l+n];
				if(!a || !b)continue;
				u = max(u, min(a,b));
			}
			if(u)d[j][j+i][m][m+k][l][l+n] = u;
		}
	}
	printf("%d",d[1][R][1][C][1][H]);
	return 0;
}

Subtask #1
1.0 / 1.0

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