hdu 5538 House Building 基础题
来源:互联网 发布:网络协议软件是什么 编辑:程序博客网 时间:2024/05/16 10:45
House Building
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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 an×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 aren 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).
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
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
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 integersn,m .
Then 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
First line of each test case is a line with two integers
The
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
23 31 0 03 1 21 1 03 31 0 10 0 01 0 1
Sample Output
3020Figure 2: A top view and side view image for sample test case 1.
#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<cmath>#include<algorithm>#include<climits>#include<queue>#include<vector>#include<map>#include<sstream>#include<set>#include<stack>#include<cctype>#include<utility>#pragma comment(linker, "/STACK:102400000,102400000")#define PI 3.1415926535897932384626#define eps 1e-10#define sqr(x) ((x)*(x))#define FOR0(i,n) for(int i=0 ;i<(n) ;i++)#define FOR1(i,n) for(int i=1 ;i<=(n) ;i++)#define FORD(i,n) for(int i=(n) ;i>=0 ;i--)#define lson num<<1,le,mid#define rson num<<1|1,mid+1,ri#define MID int mid=(le+ri)>>1#define zero(x)((x>0? x:-x)<1e-15)#define mk make_pair#define _f first#define _s secondusing namespace std;//const int INF= ;typedef long long ll;//const ll inf =1000000000000000;//1e15;//ifstream fin("input.txt");//ofstream fout("output.txt");//fin.close();//fout.close();//freopen("a.in","r",stdin);//freopen("a.out","w",stdout);const int INF =0x3f3f3f3f;//const int maxn= ;//const int maxm= ;int n,m;int height[53][53];int dir[4][2]={{-1,0},{+1,0},{0,-1},{0,+1}};bool in(int y,int x) { return 1<=y&&y<=n&&1<=x&&x<=m; }int cal(int y,int x){ int ans=0; for(int i=0;i<4;i++) { int ty=y+dir[i][0]; int tx=x+dir[i][1]; if(!in(ty,tx)) { ans+=height[y][x];continue;} int delta=height[y][x]-height[ty][tx]; if( delta<=0 ) continue; ans+=delta; } if(height[y][x]) ans++; return ans;}int main(){ int T,h;scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { scanf("%d",&h); height[i][j]=h; } } int ans=0; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { ans+=cal(i,j); } } printf("%d\n",ans); } return 0;}
0 0
- hdu 5538 House Building 基础题
- hdu 5538 House Building
- HDU 5538 house building
- 【HDU】 5538 House Building
- HDU 5538 House Building
- HDU-5538 House Building
- HDU 5538 House Building
- HDU 5538 House Building
- HDU-5538 House Building(暴力)
- HDU 5538 House Building——思路题
- hdu 5538 House Building(水)
- HDU-5538-House Building【2015长春赛区】
- HDU 5538 House Building [Ad Hoc]
- HDU 5538 House Building (简单模拟)
- 文章标题 HDU 5538 : House Building
- HDU 5538 House Building(分类暴力)
- HDU 5538 House Building (水题)
- HDU 5538 House Building( 计算几何)
- hdu 5532 Almost Sorted Array 最长上升子序列
- Maven2使用项目开发规范说明
- LeJOS学习(7):Sensor的API研究-ColorSensor
- LeetCode----Partition List
- struts2 中 Actionsupport 的作用
- hdu 5538 House Building 基础题
- 那是快感还是痛
- snake
- PHP引用(&)详解
- Codestorm:Counting Triangles 查各种三角形的个数
- MySQL-5.6.25免安装版--安装与配置方法
- android PagerAdapter用法
- 入口
- soj 2309: In the Army Now (树状数组求逆序数)