P1596 [USACO10OCT] Lake Counting S

题目

题目描述

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors. Given a diagram of Farmer John's field, determine how many ponds he has.

输入格式

Line 1: Two space-separated integers: N and M * Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.

输出格式

Line 1: The number of ponds in Farmer John's field.

题意翻译

由于近期的降雨，雨水汇集在农民约翰的田地不同的地方。我们用一个的网格图表示。每个网格中有水（） 或是旱地（）。一个网格与其周围的八个网格相连，而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图，确定当中有多少水坑。

输入第行：两个空格隔开的整数：和。

第行到第行：每行个字符，每个字符是或，它们表示网格图中的一排。字符之间没有空格。

输出一行，表示水坑的数量。

输入输出样例

输入#1

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

输出#1

3

说明/提示

OUTPUT DETAILS: There are three ponds: one in the upper left, one in the lower left, and one along the right side.

思路

方法

又又又又又是DFS，题外话(最近这几天被DFS缠住了)，不过这次的DFS还要加上判断水坑。

代码片段

void dfs(int x,int y){
	int tx,ty;
	s[x][y]='.';
	for(int i=1;i<=8;i++){
		tx=x+next1[i];
		ty=y+next2[i];
		if(tx<1||tx>n||ty<1||ty>m||s[tx][ty]=='.'){
			continue;
		}
		s[tx][ty]='.';
		dfs(tx,ty);
	}
}

真 . 完整代码

嘻嘻嘻没想到吧，我这次只是截了图，并没有直接粘代码。

真的完整代码，你们拿去吧(QAQ)呜呜呜……

有人因为我不发源代码把我(拼音:bàng dǎ)了，要我交出源代码……

顺带提示那些看着上面截图写代码的人，底下就有源代码鸭，你们不要棒打我，好吗？(不好也得好)

#include<bits/stdc++.h>
using namespace std;
int n,m,ans,next1[9]={0,0,0,-1,-1,-1,1,1,1},next2[9]={0,1,-1,0,1,-1,0,1,-1};
char s[105][105];
void dfs(int x,int y){
	int tx,ty;
	s[x][y]='.';
	for(int i=1;i<=8;i++){
		tx=x+next1[i];
		ty=y+next2[i];
		if(tx<1||tx>n||ty<1||ty>m||s[tx][ty]=='.'){
			continue;
		}
		s[tx][ty]='.';
		dfs(tx,ty);
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(s[i][j]=='W'){
				dfs(i,j);
				ans++;
			}
		}
	}
	cout<<ans;
	return 0;
}

求点赞，求关注。