DFS-HDU-1241-Oil Deposits

最新推荐文章于 2019-10-22 17:24:00 发布

Roy_Yuan

最新推荐文章于 2019-10-22 17:24:00 发布

阅读量460

点赞数

分类专栏： C练习深度优先搜索文章标签： c dfs

本文链接：https://blog.csdn.net/Roy_Yuan/article/details/47730721

版权

C练习同时被 2 个专栏收录

152 篇文章 0 订阅

订阅专栏

深度优先搜索

11 篇文章 0 订阅

订阅专栏

Oil Deposits

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18633 Accepted Submission(s): 10736

Problem Description
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

Input
The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either ‘*’, representing the absence of oil, or ‘@’, representing an oil pocket.

Output
For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

Sample Input
1 1
*
3 5
* @* @*
* * @* *
* @* @*
1 8
@@* * * * @*
5 5
* * * *@
* @@*@
* @* *@
@@@*@
@@**@
0 0

Sample Output
0
1
2
2

当初刚进软协的时候一个学长拿这个题考过我，当时只会C基础语法的我硬是憋了一个DFS出来，凑活着水吧。

//
//  main.cpp
//  简单搜索-L-Oil Deposits
//
//  Created by 袁子涵 on 15/8/17.
//  Copyright (c) 2015年 袁子涵. All rights reserved.
//

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>

using namespace::std;
int mv[8][2]={{-1,0},{1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};
const int maxn=105;
bool vis[maxn][maxn],maze[maxn][maxn];
int n,m,ans;
bool check(int x,int y)
{
    if (x<0 || x>=n || y<0 || y>=m)
        return 0;
    return maze[x][y];
}
void dfs(int x,int y)
{
    if (vis[x][y])
        return;
    vis[x][y]=1;
    for (int i=0; i<8; i++)
        if (check(x+mv[i][0], y+mv[i][1]))
            dfs(x+mv[i][0], y+mv[i][1]);
    return;
}
int main(int argc, const char * argv[]) {
    while (cin >> n >> m && n && m) {
        memset(vis, 0, sizeof(vis));
        memset(maze, 0, sizeof(maze));
        ans=0;
        char c;
        for (int i=0; i<n; i++) {
            for (int j=0; j<m; j++) {
                cin >> c;
                if (c=='@')
                    maze[i][j]=1;
            }
        }
        for (int i=0; i<n; i++) {
            for (int j=0; j<m; j++) {
                if (maze[i][j] && !vis[i][j]) {
                    ans++;
                    dfs(i,j);
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}