HDU 5538 House Building

House Building

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)

Total Submission(s): 1881    Accepted Submission(s): 1174

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.
   
   
  
  

 

Source

2015ACM/ICPC亚洲区长春站-重现赛（感谢东北师大）

 

Recommend

hujie

题意：给一个几何体求它的表面积，不计算贴地的面积

直接用总共的单位立方体个数减去重合的面积即可

#pragma comment(linker,"/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;

#define pi acos(-1.0)
#define eps 1e-10
#define pf printf
#define sf scanf
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define e tree[rt]
#define _s second
#define _f first
#define all(x) (x).begin,(x).end
#define mem(i,a) memset(i,a,sizeof i)
#define for0(i,a) for(int (i)=0;(i)<(a);(i)++)
#define for1(i,a) for(int (i)=1;(i)<=(a);(i)++)
#define mi ((l+r)>>1)
#define sqr(x) ((x)*(x))

const int inf=0x3f3f3f3f;
const int dx[]={1,0,0,-1};
const int dy[]={0,-1,1,0};
int t,n,m,a[100][100],sum,num,tag;

int pt(int x,int y)
{
    //重合的面积计算方式为每一块的面积减去相邻一块的较小值
    int t=0;
    for0(i,4)
    {
        int c=x+dx[i],b=y+dy[i];
        if(c<1||c>n||b<1||b>m)continue;
        t+=min(a[c][b],a[x][y]);
    }
    return t;
}

void solve()
{
    for1(i,n)
        for1(j,m)
        {
            if(!a[i][j])continue;
            sum-=pt(i,j);
        }
}

int main()
{
    sf("%d",&t);
    while(t--)
    {
        sum=num=0;
        sf("%d%d",&n,&m);
        for1(i,n)
            for1(j,m)
            {
                sf("%d",&a[i][j]);
                if(a[i][j])num++;//贴地的个数
                sum+=a[i][j];
            }
        sum=sum*6-num;
        for1(i,n)
            for1(j,m)
                if(a[i][j])
                    sum-=2*(a[i][j]-1);//减去每一块重合的面积
        solve();
        pf("%d\n",sum);
    }
    return 0;
}