BOI 383

Problem A. Ponding Water
Description
There is a strange building on planet VOID. It is made up of N*M
rectangular parallelepipeds on N*M grids, whose bottom surfaces are 1*1
squares. Since heights of these rectangular parallelepipeds are different,
they form a number of “holes” inside the building. After a heavy rainfall
there will be some ponding water in these holes. You are asked to
calculate the maximum possible volume of the ponding water.
Top view of the building
ponding water is painted grey on the right figure


Input
There are multiple cases, end by EOF.
For each case, the first line contains two integers, N and M (1 <= N, M <=
100), length and width of the building respectively. Then N lines followed,
each of which contains M integers (these integers are between [0,
10000]), describing the height of each rectangular parallelepiped.
Output
For each case, you should output one integer in a line, the maximum
possible volume of the ponding water.
Sample Input
3 6
3 3 4 4 4 2
3 1 3 2 1 4
7 3 1 6 4 1
3 3
3 2 3
2 2 2
3 2 3
Sample Ouput
5

0

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

struct sp
{
	int r, c, h;
	sp() {}
	sp(int x, int y, int z): r(x), c(y), h(z) {}
	bool operator<(const sp &rhs) const
	{
		return h > rhs.h;
	}
};

int R, C;
int h[110][110];
bool vis[110][110];       //vis为1的点表示最外面的墙
int dr[] = {1,0,-1,0};
int dc[] = {0,1,0,-1};
int ans, curh;
priority_queue<sp> heap;

void dfs(int r, int c)
{
	if (r<0||r>=R||c<0||c>=C) return;
	if (vis[r][c]) return;
	vis[r][c] = 1;
	if (curh >= h[r][c])
		ans += curh-h[r][c];
	else{
		heap.push(sp(r, c, h[r][c]));
		return;
	}
	for (int i = 0; i < 4; ++i)
		dfs(r+dr[i], c+dc[i]);
}

int main()
{
	int i, j, k, r, c;
	while (~scanf("%d%d", &R, &C))
	{
		memset(vis, 0, sizeof(vis));
		for (r = 0; r < R; ++r)
			for (c = 0; c < C; ++c)
				scanf("%d", &h[r][c]);
		for (r = 0; r < R; ++r)
		{
			heap.push(sp(r, 0, h[r][0]));
			vis[r][0] = 1;
			heap.push(sp(r, C-1, h[r][C-1]));
			vis[r][C-1] = 1;
		}
		for (c = 1; c < C-1; ++c)
		{
			heap.push(sp(0, c, h[0][c]));
			vis[0][c] = 1;
			heap.push(sp(R-1, c, h[R-1][c]));
			vis[R-1][c] = 1;
		}
		ans = 0;
		sp cur;
		while (!heap.empty())
		{
			cur = heap.top(); heap.pop();
			curh = cur.h;
			for (i = 0; i < 4; ++i)
				dfs(cur.r+dr[i], cur.c+dc[i]);
		}
		printf("%d\n", ans);
	}
	return 0;
}


 


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值