Clumsy Keke

Problem Description

Keke is currently studying engineering drawing courses, and the teacher has taught her how to find its volume through the three views of the part. But her brain doesn't work well that she can't find the volume of complex parts. So she needs your help.

To simplify the problem, the part is made up of cubes with side length 1, and the vertices of these cubes are all on the grid. Give you three 0/1 matrices, each representing each of the three views. 0 means that there is no projection of cubes at this position of the view; 1 means that there is a projection of cubes at this position of the view.

Now Keke wants you to help her find the volume of the part determined by the three views.

Input

There are mutiple test cases, the number of which is no more than 10. For each test case:

The first line of input contains three integers mx,my,mz(1≤mx,my,mz≤99) , which represent the coordinate range of all possible cubes (i.e. all possible cubes are in the cuboid area whose body diagonal is from (1,1,1) to (mx,my,mz)).

Following input a 0/1 matrix with mx lines and my columns representing the front view, and the y-th column of the x-th row represents the projection of all the cubes in the front view such as (x,y,?).

Following input a 0/1 matrix with my lines and mz columns representing the side view, and the z-th column of the y-th row represents the projections of all the cubes in the side view such as (?,y,z).

Following input a 0/1 matrix with mz lines and mx columns representing the top view, and the x-th column of the z-th row represents the projection of all the cubes of the top view such as (x,?,z).

The '?' in the above coordinates represents any integer. Numbers in the same line are separated by spaces. For more detailed input information, please see the sample.

Output

For each test case:

The first line of output should contain an integer, representing the volume of the part determined by the three views. If the determined part is not unique, find the largest of all possible parts.

Keke's teacher promises that there is at least one part that satisfies the input.

Sample Input

5 6 4

1 1 1 1 1 1

0 0 0 1 0 1

0 0 0 1 0 1

0 0 0 0 0 1

0 0 0 0 0 1

0 1 1 0

1 0 0 1

0 0 0 1

0 0 0 1

0 0 0 1

1 1 1 1

1 0 0 0 0

1 0 0 0 0

1 0 0 0 0

1 1 1 1 1

Sample Output

Hint

思路：

找了好长时间的规律最终失败后来想起来可以先把符合正视图的坐标保存起来然后通过后面两个视图筛听学长说这就是模拟

开三维数组模拟空间的x、y、z的坐标感觉很神奇 ……

但自己敲的时候因为没好好找坐标原点导致自己超级混乱又看到给出的点和下面的视图并不是相同方向的就不知所措了

仔细想了想其实这样给点是超级巧妙的：

建立如图坐标系：

在第一组数据中描述x和y的关系输入的点中左上角代表原点（真的是空间坐标原点）向右为y 向下为x 均从零依次增大再去标记点岂不是很容易

同理第二次输入z和y的关系左上角依然是原点

所以建立坐标系一定要找准原点不然就像刚开始那样乱找关系容易错误

AC代码：

#include<stdio.h>

#include<string.h>

const int MAX=1e2;

int main()

{

    int a[MAX+5][MAX+5][MAX+5],x,y,z;

    while(~scanf("%d%d%d",&x,&y,&z)){

        memset(a,0,sizeof(a));

        int sum=0;              ///标记的总个数-后来删去的个数=最终结果 开始是最后重新跑了

        for(int i=0;i<x;i++){        ///次循环判断个数 但T了 只好这样改了

            for(int j=0;j<y;j++){

                int num;

                scanf("%d",&num);

                if(num==1){

                    for(int k=0;k<z;k++){

                        a[i][j][k]=1;

                        sum++; ///符合主视图 条件的所有点的个数

                    }

                }

            }

        }

        for(int i=0;i<y;i++){

            for(int j=0;j<z;j++){

                int num;

                scanf("%d",&num);

                if(num==0){

                    for(int k=0;k<x;k++){

                        if(a[k][i][j]==1){

                            a[k][i][j]=-1;

                            sum--; ///从原来标记的点中删去不符合侧视图的点

                        }

                    }

                }

            }

        }

        for(int i=0;i<z;i++){

            for(int j=0;j<x;j++){

                int num;

                scanf("%d",&num);

                if(num==0){

                    for(int k=0;k<y;k++){

                        if(a[j][k][i]==1){

                            a[j][k][i]=-1;

                            sum--;     ///从原来标记的点中删去不符合俯视图的点

                        }

                    }

                }

            }

        }

        printf("%d\n",sum);

    }

    return 0;

}

巴特西

Clumsy Keke【模拟+三维数组】

Clumsy Keke

最新文章

热门文章