HDU 5538 House Building（2015ACM/ICPC亚洲区长春&&几何体表面积）

【题目链接】：click here~~

【题目描述】：

House Building

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 119    Accepted Submission(s): 97

Problem Description

Have you ever played the video game Minecraft? This game has been one of the world's most popular game in recent years. The world of Minecraft is made up of lots of 1×1×1 blocks in a 3D map. Blocks are the basic units of structure in Minecraft, there are many types of blocks. A block can either be a clay, dirt, water, wood, air, ... or even a building material such as brick or concrete in this game.


Figure 1: A typical world in Minecraft.

Nyanko-san is one of the diehard fans of the game, what he loves most is to build monumental houses in the world of the game. One day, he found a flat ground in some place. Yes, a super flat ground without any roughness, it's really a lovely place to build houses on it. Nyanko-san decided to build on a n×m big flat ground, so he drew a blueprint of his house, and found some building materials to build.

While everything seems goes smoothly, something wrong happened. Nyanko-san found out he had forgotten to prepare glass elements, which is a important element to decorate his house. Now Nyanko-san gives you his blueprint of house and asking for your help. Your job is quite easy, collecting a sufficient number of the glass unit for building his house. But first, you have to calculate how many units of glass should be collected.

There are n rows and m columns on the ground, an intersection of a row and a column is a 1×1 square,and a square is a valid place for players to put blocks on. And to simplify this problem, Nynako-san's blueprint can be represented as an integer array ci,j(1≤i≤n,1≤j≤m) . Which ci,j indicates the height of his house on the square of i -th row and j -th column. The number of glass unit that you need to collect is equal to the surface area of Nyanko-san's house(exclude the face adjacent to the ground).

 

Input

The first line contains an integer T indicating the total number of test cases.
First line of each test case is a line with two integers n,m .
The n lines that follow describe the array of Nyanko-san's blueprint, the i -th of these lines has m integers ci,1,ci,2,...,ci,m , separated by a single space.

1≤T≤50
1≤n,m≤50
0≤ci,j≤1000

 

Output

For each test case, please output the number of glass units you need to collect to meet Nyanko-san's requirement in one line.

 

Sample Input

  
  

   
   2
3 3
1 0 0
3 1 2
1 1 0
3 3
1 0 1
0 0 0
1 0 1
  
  

 

Sample Output

  
  

   
   30
20


   
   
    
    
   
   

   
   
    
    Figure 2: A top view and side view image for sample test case 1.
   
   
  
  

【题目大意】：给出一个三维空间几何体，求出其表面积。

【思路】：简单模拟，先算出第一层平面，然后在以此往上，4个方向累加即可。

代码：

/*
* Problem:HDU 5538
* Running time: 31MS
* Complier: G++
* Author: javaherongwei
* Create Time: 21:20 2015/11/02 星期一
*/
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn=233;
int dir4[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int mat[maxn][maxn];
int main()
{
    //freopen("1.txt","r",stdin);
    int t;scanf("%d",&t);
    while(t--){
        memset(mat,0,sizeof(mat));
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1; i<=n; ++i){
            for(int j=1; j<=m; ++j){
                scanf("%d",&mat[i][j]);
            }
        }
        int s=0;
        for(int i=1; i<=n; ++i){
            for(int j=1; j<=m; ++j){
                int c1=mat[i][j];
                if(c1>0) s++;  //最后一层的面积
                for(int k=0; k<4; ++k){
                    int di=i+dir4[k][0];
                    int dj=j+dir4[k][1];
                    int c2=mat[di][dj];
                    if(c1>c2) s+=(c1-c2); //第二层以上的四个方向的面积
                }
            }
        }
        printf("%d\n",s);
    }
    return 0;
}