HDU ACM 3 1241 Oil Deposits深搜

最新推荐文章于 2020-07-28 17:25:32 发布

lunaArcher

最新推荐文章于 2020-07-28 17:25:32 发布

阅读量312

点赞数

本文链接：https://blog.csdn.net/lunaArcher/article/details/53152882

版权

和水坑题一毛一样

#include <cstdio>
int N, M;
char Lu[1001][1001];
void dfs(int x, int y)
{
	Lu[x][y] = '*';
	for (int i = -1; i <= 1; i++)
		for (int j = -1; j <= 1; j++){
			int nx = x + i, ny = y + j;
			if (nx >= 1 && nx <= N && ny >= 1 && ny <= M && Lu[nx][ny] == '@')
				dfs(nx, ny);
		}
	return ;
}
int main()
{
	while (scanf("%d%d%*c", &N, &M) && (N,M))
	{
		for (int i = 1; i <= N; i++){
			for (int j = 1; j <= M; j++)
				scanf("%c", &Lu[i][j]);
			scanf("%*c");
		}
		int sum = 0;
		for (int i = 1; i <= N; i++)
			for (int j = 1; j <= M; j++)
				if (Lu[i][j] == '@'){
					dfs(i, j);
					sum++;
				}
		printf("%d\n", sum);
	}
	return 0;
}