oj.uz

답안 #8349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
8349 2014-09-13T02:11:53 Z ptncks0121 일도양단! (kriii1_1) C++
1 / 1
 0 ms 2112 KB 
#include <stdio.h>
  
int R,C,H,N,G[8][8][8];
int D[8][8][8][8][8][8];
  
int min(int a, int b){return a < b ? a : b;}
int max(int a, int b){return a > b ? a : b;}
int sum(int x1, int x2, int y1, int y2, int z1, int z2)
{
    return G[x2][y2][z2] - G[x1-1][y2][z2] - G[x2][y1-1][z2] - G[x2][y2][z1-1] + G[x1-1][y1-1][z2] + G[x1-1][y2][z1-1] + G[x2][y1-1][z1-1] - G[x1-1][y1-1][z1-1];
}
  
int main()
{
    int x,y,z,i;
  
    scanf ("%d %d %d %d",&R,&C,&H,&N);
    for (i=0;i<N;i++){
        scanf ("%d %d %d",&x,&y,&z);
        G[x][y][z]++;
    }
  
    for (x=1;x<=R;x++) for (y=1;y<=C;y++) for (z=1;z<=H;z++){
        G[x][y][z] += G[x-1][y][z] + G[x][y-1][z] + G[x][y][z-1];
        G[x][y][z] -= G[x-1][y-1][z] + G[x-1][y][z-1] + G[x][y-1][z-1];
        G[x][y][z] += G[x-1][y-1][z-1];
    }
  
    int r,r1,r2,c,c1,c2,h,h1,h2;
  
    for (r=1;r<=R;r++) for (r1=1,r2=r;r2<=R;r1++,r2++){
        for (c=1;c<=C;c++) for (c1=1,c2=c;c2<=C;c1++,c2++){
            for (h=1;h<=H;h++) for (h1=1,h2=h;h2<=H;h1++,h2++){
                int s = sum(r1,r2,c1,c2,h1,h2);
                int v = r * c * h;
                  
                int &d = D[r1][r2][c1][c2][h1][h2];
                if (s == 0) d = -1;
                else if (s == 1) d = v;
                else{
                    for (i=r1;i<r2;i++) d = max(d,min(D[r1][i][c1][c2][h1][h2],D[i+1][r2][c1][c2][h1][h2]));
                    for (i=c1;i<c2;i++) d = max(d,min(D[r1][r2][c1][i][h1][h2],D[r1][r2][i+1][c2][h1][h2]));
                    for (i=h1;i<h2;i++) d = max(d,min(D[r1][r2][c1][c2][h1][i],D[r1][r2][c1][c2][i+1][h2]));
                }
            }
        }
    }
  
    printf ("%d\n",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