HDU 5538 House Building (水题)
来源:互联网 发布:it猎头 编辑:程序博客网 时间:2024/05/27 19:27
House Building
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1218 Accepted Submission(s): 765
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 of1×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 arrayci,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.
题意:给定一个三维图的矩阵形式,某点(i,j)的数值代表该格子(i,j)中积木的个数,求该图形露出的表面积。
思路:某点若有积木则代表肯定上表面要计算,之后对所有边界进行计算,最后遍历每个格子的积木,只要比旁边的积木多则需要加上多出的面积。
#include <iostream>#include <string.h>#include <algorithm>using namespace std;int a[55][55];int main(){ int t; cin>>t; while(t--){ int n,m; scanf("%d %d",&n,&m); long long sum=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ scanf("%d",&a[i][j]); if(a[i][j]!=0){ sum++; } } } for(int i=0;i<n;i++){ sum+=a[i][0]; sum+=a[i][m-1]; } for(int i=0;i<m;i++){ sum+=a[0][i]; sum+=a[n-1][i]; } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ int b=a[i][j]; if(j-1>=0){ if(b>a[i][j-1]){ sum+=b-a[i][j-1]; } } if(j+1<m){ if(b>a[i][j+1]){ sum+=b-a[i][j+1]; } } if(i-1>=0){ if(b>a[i-1][j]){ sum+=b-a[i-1][j]; } } if(i+1<n){ if(b>a[i+1][j]){ sum+=b-a[i+1][j]; } } } } printf("%d\n",sum); } 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 (水)
- HDU 5538 House Building (求表面积)
- HDU-5538 House Building(暴力)
- hdu 5538House Building(长春现场赛)
- hdu 5538 House Building(长春现场赛)
- hdu 5538 House Building(长春现场赛——水题)
- hdu 5538 House Building 基础题
- 51nod 集合计数(拓展欧几里得)
- Linux环境下的脚本—shell(三)
- 线程中 CloseHandle()函数的使用
- 不使用strcmp函数比较两个字符串的大小
- 61. Rotate List
- HDU 5538 House Building (水题)
- Toast 优化
- UVA 10905 Children's Game(贪心)
- CH 30 摆花 [动态规划] [矩阵快速幂优化]
- [Leetcode]388. Longest Absolute File Path
- Centreon+Nagios实战第四篇——监控端安装NDOUtils
- jsp分页
- 用多态实现模拟电脑-硬盘-U盘-MP3读写数据的功能
- View的事件分发机制