Submission #5364

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5364	2014-04-12 02:53:14	baneling100	일도양단! (kriii1_1)	C++98	0 / 1	0 ms	3136 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>
#define inf 1000000000
int R, C, H, N, d[8][8][8][8][8][8], grape[8][8][8][8][8][8];
void input(void)
{
    int i, r, c, h;
    scanf("%d %d %d %d",&R,&C,&H,&N);
    for(i=1 ; i<=N ; i++)
    {
        scanf("%d %d %d",&r,&c,&h);
        grape[r][r][c][c][h][h]=1;
    }
}
void process(void)
{
    int i, j, k, l, r1, r2, c1, c2, h1, h2;
    for(i=1 ; i<=R ; i++)
        for(j=1 ; j<=C ; j++)
            for(k=1 ; k<=H ; k++)
                for(r1=1 ; r1<=R-i+1 ; r1++)
                {
                    r2=r1+i-1;
                    for(c1=1 ; c1<=C-j+1 ; c1++)
                    {
                        c2=c1+j-1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 1