hdu 5538 House Building

最新推荐文章于 2018-10-02 14:20:35 发布

bigfiremelon

最新推荐文章于 2018-10-02 14:20:35 发布

阅读量596

点赞数

CC 4.0 BY-SA版权

分类专栏： acm 文章标签： hdu

本文链接：https://blog.youkuaiyun.com/bigwaterlon/article/details/49592435

acm 专栏收录该内容

62 篇文章

订阅专栏

本文深入探讨了游戏开发领域的关键技术，包括游戏引擎、编程语言、硬件优化等，并重点介绍了AI音视频处理在游戏开发中的应用，如语义识别、语音识别、AR效果等，为游戏开发者提供了一站式的解决方案和技术指南。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample Output

30
20


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

题目大意：

在我的世界中造房子，算表面积；

解题思路：

没什么好说的数学题考空间思维（我才不告诉你这题不是我做的）

代码：

#include <bits/stdc++.h>
using namespace std;

int go[55][55];

int main()
{
    int T, n, m;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &n, &m);
        memset(go, 0, sizeof(go));
        int ans = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
            {
                scanf("%d", &go[i][j]);
                if (go[i][j] > 0)
                    ans++;
            }
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
            {
                ans += max(0, go[i][j]-go[i][j-1]);
                ans += max(0, go[i][j]-go[i][j+1]);
            }
        for (int j = 1; j <= m; j++)
            for (int i = 1; i <= n; i++)
            {
                ans += max(0, go[i][j]-go[i-1][j]);
                ans += max(0, go[i][j]-go[i+1][j]);
            }
        printf("%d\n", ans);
    }
    return 0;
}