# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5941 | baneling100 | 일도양단! (kriii1_1) | C++98 | 0 ms | 3140 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
int R, C, H, N, A[8][8][8][8][8][8], D[8][8][8][8][8][8];
void input(void)
{
int i, j, k, l, m, n, o, r, c, h;
scanf("%d %d %d %d",&R,&C,&H,&N);
for(i=1 ; i<=R ; i++)
for(j=1 ; j<=C ; j++)
for(k=1 ; k<=H ; k++)
for(l=i ; l<=R ; l++)
for(m=j ; m<=C ; m++)
for(n=k ; n<=H ; n++)
A[i][l][j][m][k][n]=D[i][l][j][m][k][n]=-1;
for(i=1 ; i<=N ; i++)
{
scanf("%d %d %d",&r,&c,&h);
A[r][r][c][c][h][h]=1;
}
}
void makeA(int lr, int rr, int lc, int rc, int lh, int rh)
{
int i;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |