Submission #8349

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
8349	2014-09-13 02:11:53	ptncks0121	일도양단! (kriii1_1)	C++98	1 / 1	0 ms	2112 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>
  
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;
  
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1