2018计算机学科夏令营上机考试C题--双DFS

题目来源：百练/poj 1481 The Die Is Cast

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
int col, row;
const int maxn = 60;
char maze[maxn][maxn];

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int num[1000]; //每一块中X的数目
int cnt = 0;   //统计有几个连通块

bool judge(int x, int y)
{
    if (x < 0 || y < 0 || x >= row || y >= col || maze[x][y] == '.')
    {
        return false;
    }
    return true;
}

void dfs2(int x, int y)
{
    maze[x][y] = '*'; //替换成*
    for (int i = 0; i < 4; i++)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (judge(nx, ny) == false)
        {
            continue;
        }
        if (maze[nx][ny] == 'X')
        {
            dfs2(nx, ny);
        }
    }
}

void dfs1(int x, int y)
{
    maze[x][y] = '.'; //替换成.
    for (int i = 0; i < 4; i++)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (judge(nx, ny) == false)
        {
            continue;
        }
        if (maze[nx][ny] == 'X')
        {
            dfs2(nx, ny);
            num[cnt]++;
        }
        if (maze[nx][ny] == '*')  //不要写成else if 了。。
        {
            dfs1(nx, ny);
        }
    }
}

int main()
{
    int index = 1;
    while (scanf("%d%d", &col, &row) && (col || row))
    {
        cnt = 0;
        fill(num, num + maxn, 0);
        fill(maze[0], maze[0] + maxn * maxn, '0');
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++)
            {
                cin >> maze[i][j];
            }
        }
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++)
            {
                if (maze[i][j] == '*')
                {
                    dfs1(i, j);
                    cnt++;
                }
            }
        }
        sort(num, num + cnt);
        cout << "Throw " << index++ << endl;
        for (int i = 0; i < cnt; i++)
        {
            if (num[i] != 0)　//0不要输出
            {
                cout << num[i] << ' ';
            }
        }
        cout << endl
             << endl; //要有空行
    }
    return 0;
}