oj.uz

답안 #19543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19543 2016-02-24T16:56:17 Z gs14004 일도양단! (kriii1_1) C++14
1 / 1
 1 ms 2748 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;

int a[8][8][8];
int dp[8][8][8][8][8][8];

int getsum(int sx, int ex, int sy, int ey, int sz, int ez){
	return a[ex][ey][ez] - a[sx-1][ey][ez] - a[ex][sy-1][ez] - a[ex][ey][sz-1] + a[sx-1][sy-1][ez] + a[sx-1][ey][sz-1] + a[ex][sy-1][sz-1] - a[sx-1][sy-1][sz-1];
}

int f(int sx, int ex, int sy, int ey, int sz, int ez){
	int t = getsum(sx, ex, sy, ey, sz, ez);
	if(t == 0) return -1e9;
	if(t == 1) return (ex - sx + 1) * (ey - sy + 1) * (ez - sz + 1);
	if(dp[sx][ex][sy][ey][sz][ez]) return dp[sx][ex][sy][ey][sz][ez];
	int ret = 0;
	for(int i=sx; i<ex; i++){
		ret = max(ret, 
			min(f(sx, i, sy, ey, sz, ez),
				f(i+1, ex, sy, ey, sz, ez)));
	}
	for(int i=sy; i<ey; i++){
		ret = max(ret, 
			min(f(sx, ex, sy, i, sz, ez),
				f(sx, ex, i+1, ey, sz, ez)));
	}
	for(int i=sz; i<ez; i++){
		ret = max(ret, 
			min(f(sx, ex, sy, ey, sz, i),
				f(sx, ex, sy, ey, i+1, ez)));
	}
	return dp[sx][ex][sy][ey][sz][ez] = ret;
}

int main(){
	int x, y, z, n;
	cin >> x >> y >> z >> n;
	for(int i=0; i<n; i++){
		int p, q, r;
		cin >> p >> q >> r;
		a[p][q][r]++;
	}
	for(int i=1; i<=x; i++){
		for(int j=1; j<=y; j++){
			for(int k=1; k<=z; k++){
				a[i][j][k] += a[i-1][j][k] + a[i][j-1][k] + a[i][j][k-1] - a[i-1][j-1][k] - a[i-1][j][k-1] - a[i][j-1][k-1] + a[i-1][j-1][k-1];
			}
		}
	}
	cout << f(1, x, 1, y, 1, z);
}

Subtask #1
1.0 / 1.0

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