Submission #19160

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
19160	2016-02-19 06:05:43	Namnamseo	일도양단! (kriii1_1)	C++14	1 / 1	17 ms	2364 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 <cstdio>
int x,y,z;
int nx[100];
int ny[100];
int nz[100];
int n;
int cube(int a,int b,int c,int d,int e,int f){
    int ret=0, i;
    for(i=0;i<n;++i){
        if(a<=nx[i] && nx[i]<=b &&
           c<=ny[i] && ny[i]<=d &&
           e<=nz[i] && nz[i]<=f) ++ret;
    }
    return ret;
}
int  dp[8][8][8][8][8][8];
bool dc[8][8][8][8][8][8];
template<typename T> inline T max(T a,T b){ return b<a?a:b; }
template<typename T> inline T min(T a,T b){ return a<b?a:b; }
int work(int a,int b,int c,int d,int e,int f){
    int myn = cube(a,b,c,d,e,f);
    if(myn==1) return (b-a+1)*(d-c+1)*(f-e+1);
    if(dc[a][b][c][d][e][f]) return dp[a][b][c][d][e][f];
    dc[a][b][c][d][e][f]=1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1