Submission #3333

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
3333	2013-08-30 12:16:10	mjy0503	일도양단! (kriii1_1)	C++98	1 / 1	4 ms	1772 KiB

1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1