DPS

POJ2386

Description

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.

Input

• 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.

Output

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

Sample Input

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

Sample Out3从任一‘w’节点开始，遍历所有相邻’w’节点，每遍历一个‘w’节点就将该节点置为’.’，最后执行了几次遍历过程就有几个ponds。

#include<iostream>
#include<cstdio>
using namespace std;
#define N 100
char array[N][N];
void solve(int,int);
int m=0,n=0;
int main(){
    //输入
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>array[i][j];
        }
    }

    int num=0;
    //遍历‘w’节点
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(array[i][j]=='W'){
                num++;
                solve(i,j);
            }

        }
    }
    cout<<num<<endl;
    return 0;
}
void solve(int x,int y){
    array[x][y]='s';
    //遍历相邻'w'节点
    int nodei,nodej;//（node_i,node_j）表示当前正在判断的节点
    //遍历与当前节点相邻的八个节点
    for(int i=-1;i<=1;i++){
        for(int j=-1;j<=1;j++){
            nodei=x+i;
            nodej=y+j;
            if((nodei>=0)&&(nodei<=n)&&(nodej>=0)&&(nodej<=m)&&(array[nodei][nodej]=='W'))
            //判断节点是否处于边界内且值为'w'
                solve(nodei,nodej);
        }
    }
}

---

---

POJ1321

Description

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input

输入含有多组测试数据。
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <= n
当为-1 -1时表示输入结束。
随后的n行描述了棋盘的形状：每行有n个字符，其中 # 表示棋盘区域， . 表示空白区域（数据保证不出现多余的空白行或者空白列）。

Output

对于每一组数据，给出一行输出，输出摆放的方案数目C （数据保证C<2^31）。

Sample Input

2 1
#.
.#
4 4
...#
..#.
.#..
#...
-1 -1

Sample Output

2
1

思路：对棋盘逐行遍历，同时用一个一维数组标记每一列是否有棋子，每次遍历到布下k颗棋子或到达下边界停止递归。

#include<iostream>
using namespace std;
#define N 1000
char board[N][N];
int n, k;
int num = 0; //解决方案数目
int col[N]; //标记每一列是否放有棋子

void dfs1321(int, int);
int solve1321() {
    //Input
    cin >> n >> k;
    while (n != -1 && k != -1) {
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                cin >> board[i][j];

        for (int i = 0; i < n; i++)//重置标记数组
            col[i] = 0;

        num = 0;//重置解决方案数
        dfs1321(0, k);
        cout << num << endl;
        cin >> n >> k;
    }

    return 0;
}
void dfs1321(int row, int nk) {
    if (row == n || nk == 0) {
        if (nk == 0)
            num++;
        return;
    } //遍历完n行或者成功布下k个棋子后停止递归

    for (int i = 0; i < n; i++) {
        if (col[i] == 0 && board[row][i] == '#') {
            col[i] = 1;//标记列状态
            dfs1321(row + 1, nk - 1);
            col[i] = 0;还原列标志
        }

    }
    dfs1321(row + 1, nk);//这里要非常注意，当k<n时，可能当前行不放置棋子，需要跳过；或者之前已经放置好k个棋子。这一步用来处理多余行
    return;

}
int main() {

    solve1321();
}