Submission #3336

# Submission time Handle Problem Language Result Execution time Memory
3336 2013-08-30T12:42:32 Z wookayin 일도양단! (kriii1_1) C++
1 / 1
4 ms 2132 KB
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;

int R, C, H, N;
int has[7][7][7];

struct xyz {
        int x, y, z;
        xyz(int x, int y, int z) : x(x), y(y), z(z) {}
};
vector<xyz> pos;

int count(int r1, int r2, int c1, int c2, int h1, int h2) {
        int s = 0;
        for(int i = 0; i < pos.size(); ++ i) {
                xyz &q = pos[i];
                if(r1 <= q.x && q.x <= r2 && c1 <= q.y && q.y <= c2 && h1 <= q.z && q.z <= h2)
                        s ++;
        }
        return s;
}

int cache[7][7][7][7][7][7];
int go(int r1, int r2, int c1, int c2, int h1, int h2) {
        int &ret = cache[r1][r2][c1][c2][h1][h2];
        if(ret != -1) return ret;

        // 건빵이 하나 들어있으면
        int raisins = count(r1, r2, c1, c2, h1, h2);
        if(raisins == 1)
                return ret = (r2-r1+1) * (c2-c1+1) * (h2-h1+1);

        ret = -987987987;
        for(int r = r1; r < r2; ++ r) {
                int t1 = go(r1, r, c1, c2, h1, h2);
                int t2 = go(r+1, r2, c1, c2, h1, h2);
                int tv = min(t1, t2);
                ret = max(ret, tv);
        }
        for(int c = c1; c < c2; ++ c) {
                int t1 = go(r1, r2, c1, c, h1, h2);
                int t2 = go(r1, r2, c+1, c2, h1, h2);
                int tv = min(t1, t2);
                ret = max(ret, tv);
        }
        for(int h = h1; h < h2; ++ h) {
                int t1 = go(r1, r2, c1, c2, h1, h);
                int t2 = go(r1, r2, c1, c2, h+1, h2);
                int tv = min(t1, t2);
                ret = max(ret, tv);
        }
        return ret;
}

int main() {
        cin >> R >> C >> H >> N;
        for(int i = 0; i < N; ++ i) {
                int r, c, h;
                cin >> r >> c >> h;
                r--; c--; h--;
                pos.push_back( xyz(r,c,h) );
                has[r][c][h] = 1;
        }
        memset(cache, -1, sizeof(cache));
        int res = go(0, R-1, 0, C-1, 0, H-1);
        printf("%d\n", res);
        return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2132 KB Output is correct
2 Correct 0 ms 2132 KB Output is correct
3 Correct 0 ms 2132 KB Output is correct
4 Correct 0 ms 2132 KB Output is correct
5 Correct 0 ms 2132 KB Output is correct
6 Correct 0 ms 2132 KB Output is correct
7 Correct 0 ms 2132 KB Output is correct
8 Correct 0 ms 2132 KB Output is correct
9 Correct 0 ms 2132 KB Output is correct
10 Correct 0 ms 2132 KB Output is correct
11 Correct 0 ms 2132 KB Output is correct
12 Correct 0 ms 2132 KB Output is correct
13 Correct 0 ms 2132 KB Output is correct
14 Correct 0 ms 2132 KB Output is correct
15 Correct 0 ms 2132 KB Output is correct
16 Correct 0 ms 2132 KB Output is correct
17 Correct 0 ms 2132 KB Output is correct
18 Correct 0 ms 2132 KB Output is correct
19 Correct 0 ms 2132 KB Output is correct
20 Correct 0 ms 2132 KB Output is correct
21 Correct 0 ms 2132 KB Output is correct
22 Correct 0 ms 2132 KB Output is correct
23 Correct 0 ms 2132 KB Output is correct
24 Correct 0 ms 2132 KB Output is correct
25 Correct 0 ms 2132 KB Output is correct
26 Correct 4 ms 2132 KB Output is correct
27 Correct 0 ms 2132 KB Output is correct
28 Correct 0 ms 2132 KB Output is correct
29 Correct 0 ms 2132 KB Output is correct
30 Correct 0 ms 2132 KB Output is correct
31 Correct 0 ms 2132 KB Output is correct
32 Correct 0 ms 2132 KB Output is correct
33 Correct 0 ms 2132 KB Output is correct
34 Correct 0 ms 2132 KB Output is correct
35 Correct 0 ms 2132 KB Output is correct
36 Correct 0 ms 2132 KB Output is correct
37 Correct 0 ms 2132 KB Output is correct
38 Correct 0 ms 2132 KB Output is correct
39 Correct 0 ms 2132 KB Output is correct
40 Correct 0 ms 2132 KB Output is correct
41 Correct 0 ms 2132 KB Output is correct
42 Correct 0 ms 2132 KB Output is correct
43 Correct 0 ms 2132 KB Output is correct
44 Correct 0 ms 2132 KB Output is correct
45 Correct 0 ms 2132 KB Output is correct
46 Correct 0 ms 2132 KB Output is correct
47 Correct 0 ms 2132 KB Output is correct
48 Correct 0 ms 2132 KB Output is correct
49 Correct 0 ms 2132 KB Output is correct
50 Correct 0 ms 2132 KB Output is correct
51 Correct 0 ms 2132 KB Output is correct
52 Correct 0 ms 2132 KB Output is correct
53 Correct 0 ms 2132 KB Output is correct
54 Correct 0 ms 2132 KB Output is correct
55 Correct 0 ms 2132 KB Output is correct
56 Correct 0 ms 2132 KB Output is correct
57 Correct 0 ms 2132 KB Output is correct
58 Correct 0 ms 2132 KB Output is correct
59 Correct 0 ms 2132 KB Output is correct
60 Correct 0 ms 2132 KB Output is correct
61 Correct 0 ms 2132 KB Output is correct
62 Correct 0 ms 2132 KB Output is correct
63 Correct 0 ms 2132 KB Output is correct
64 Correct 0 ms 2132 KB Output is correct
65 Correct 0 ms 2132 KB Output is correct
66 Correct 0 ms 2132 KB Output is correct
67 Correct 0 ms 2132 KB Output is correct
68 Correct 0 ms 2132 KB Output is correct
69 Correct 0 ms 2132 KB Output is correct
70 Correct 0 ms 2132 KB Output is correct
71 Correct 0 ms 2132 KB Output is correct
72 Correct 0 ms 2132 KB Output is correct
73 Correct 0 ms 2132 KB Output is correct
74 Correct 0 ms 2132 KB Output is correct
75 Correct 0 ms 2132 KB Output is correct
76 Correct 0 ms 2132 KB Output is correct
77 Correct 0 ms 2132 KB Output is correct
78 Correct 0 ms 2132 KB Output is correct
79 Correct 0 ms 2132 KB Output is correct
80 Correct 0 ms 2132 KB Output is correct
81 Correct 0 ms 2132 KB Output is correct
82 Correct 0 ms 2132 KB Output is correct
83 Correct 0 ms 2132 KB Output is correct
84 Correct 0 ms 2132 KB Output is correct
85 Correct 0 ms 2132 KB Output is correct
86 Correct 0 ms 2132 KB Output is correct
87 Correct 0 ms 2132 KB Output is correct
88 Correct 0 ms 2132 KB Output is correct
89 Correct 0 ms 2132 KB Output is correct
90 Correct 0 ms 2132 KB Output is correct
91 Correct 0 ms 2132 KB Output is correct
92 Correct 0 ms 2132 KB Output is correct
93 Correct 0 ms 2132 KB Output is correct
94 Correct 0 ms 2132 KB Output is correct
95 Correct 0 ms 2132 KB Output is correct
96 Correct 0 ms 2132 KB Output is correct
97 Correct 0 ms 2132 KB Output is correct
98 Correct 0 ms 2132 KB Output is correct
99 Correct 0 ms 2132 KB Output is correct
100 Correct 0 ms 2132 KB Output is correct