【Python】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.

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

输入格式

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.

第1行：两个空格隔开的整数：N 和 M 第2行到第N+1行：每行M个字符，每个字符是'W'或'.'，它们表示网格图中的一排。字符之间没有空格。

输出格式

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

代码如下：（算是DFS模板题？）

import sys
sys.setrecursionlimit(1000000000)    # 重新设置递归次数


def check(a, b):
    if 0 <= a <= n - 1 and 0 <= b <= m - 1 and v[a][b] == 'W':
        return True
    return False


def dfs(x, y):
    v[x][y] = '.'   # 标记为走过
    for i in range(-1, 2):      # 搜索四周
        for j in range(-1, 2):
            a = x + i
            b = y + j
            if check(a, b):
                dfs(a, b)
    return


n, m = map(int, input().split())
v = [[i for i in input()] for _ in range(n)]
ans = 0
for i in range(n):
    for j in range(m):
        if v[i][j] == 'W':
            dfs(i, j)
            ans += 1    # 水潭数
print(ans)

DFS的板子：

def check(参数):
    if (满足条件):
        return 1
    return 0


def dfs(参数):
    if (越界不合法情况):
        return
    if (终点边界, 输出答案):
        return
    for (循环枚举所有方案):
        if (未被标记):
        (标记)
        dfs(下一层)
        (还原标记)