2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大)HDU5538 House Building
2015-11-01 17:24
417 查看
House Building
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 14 Accepted Submission(s): 13
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亚洲区长春站-重现赛(感谢东北师大)
解题报告:2015 ACM/ICPC 长春赛区现场赛解题报告汇总
相关文章推荐
- iOS--- 如何获得UIView的父控制器
- hdu 5538House Building(长春现场赛)
- 如何清除或初始化 easyui 的 treegrid 控件的数据
- unknwn filesystem entering rescue mode grup rescue解决办法
- setClickable(true)不起作用
- 【iOS】UIAlertView 点击跳转事件
- uIP使用记录
- [sicily]1443. Printer Queue
- UIScrollView 侧滑的手势冲突怎么解决?
- request.getRequestDispatcher()的两个方法forward()/include()!!!
- EasyUI - DataGrid 组建 - [ 搜索功能 ]
- hdu 5538 House Building 基础题
- easyui-datagrid的一些操作记录
- hdu1297 Children’s Queue (动态规划,n个人排成一列的方案数+高精加)
- 消息队列机制messageQuene
- queue的用法
- requirejs项目部署
- required定义
- OC 学习笔记4 NSSet NSMutableSet NSDictionary NSMutableDictionary NSNumber NSValue
- [Chromium官方博客文章转载]Jank Busters Part One(UI Jank指的是界面来不及刷新导致的卡塞空白现象?