Clumsy Keke（盖楼法模拟）

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

题意：

给出长宽高，给出三视图0代表在二维图形没有东西，1代表有

盖楼法模拟即可

ac代码：

#include<iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int c,k,g,st[101][101][101],temp;
int main()
{
    while(cin>>c>>k>>g)
        {
        memset(st,0,sizeof(st));
        for(int i=1;i<=c;i++)
        {
            for(int j=k;j>=1;j--)
                {
                scanf("%d",&temp);
                if(temp==1)
                for(int jj=1;jj<=g;jj++)
                    {
                    st[i][j][jj]++;
                    //printf("%d %d %done\n",i,j,jj);
                }
            }
        }
        for(int i=k;i>=1;i--)
        {
            for(int j=g;j>=1;j--)
                {
                scanf("%d",&temp);
                if(temp==1)
                for(int jj=1;jj<=c;jj++)
                {
                    st[jj][i][j]++;
                    //printf("%d %d %dtwo\n",jj,i,j);
                }
            }
        }
        for(int j=g;j>=1;j--)
        {
            for(int i=1;i<=c;i++)
                {
                scanf("%d",&temp);
                if(temp==1)
                for(int jj=1;jj<=k;jj++)
                    {
                    st[i][jj][j]++;
                    //printf("%d %d %dthree\n",i,jj,j);
                }
            }
        }
        int hz=0;
        for(int i=1;i<=c;i++)
        {
            for(int j=1;j<=k;j++)
                {
                for(int jj=1;jj<=g;jj++)
                {
                    if(st[i][j][jj]>=3)//三个方位都有
                        {
                        hz++;
                        //printf("%d %d %d\n",i,j,jj);
                    }
                }
            }
        }
        cout<<hz<<endl;
    }
    return 0;
}