HDU (1241)

Source: Internet
Author: User

Oil deposits

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 16742 Accepted Submission (s): 9626

Problem Description
The Geosurvcomp Geologic Survey company are 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 Numer OUs square plots. It then analyzes each plot separately, using a sensing equipment to determine whether or not of the plot contains oil. A plot containing oil is called a pocket. If the pockets is adjacent, then they is part of the same oil deposit. Oil deposits can is quite large and may contain numerous pockets. Your job is to determine how many different oil deposits be contained in a grid.

Input
The input file contains one or more grids. Each of the grids 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 <= and 1 <= n <= 100. Following this is m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and are either ' * ', representing the absence of oil, or ' @ ', representing a oil PO Cket.

Output
For each grid, output the number of distinct oil deposits. The different pockets is part of the same oil deposit if they is adjacent horizontally, vertically, or diagonally. An oil deposit won't contain more than pockets.

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

Sample Output
0
1
2

2

The first knowledge of Dfs is difficult, had to brush the question ...

The main idea of the problem is to find an oil to the side from the location of the oil to search up and down diagonally diagonal search, if the oil is found to mark 1

#include <stdio.h> #include <iostream> #include <string.h>using namespace Std;int n,m;int vis[110][  110];char c[110][110];void dfs (int x,int y) {if (vis[x][y]) return; Tagged if (x>=n| | y>=m| | x<0| |  Y&LT;0) return;    Boundary condition if (c[x][y]== ' @ ')//silly only know write multiple, do not know with loop ...  {vis[x][y]=1;        Locate the neighboring oil ground DFS (x+1,y);        DFS (X-1,Y);        DFS (X,Y+1);        DFS (X,Y-1);        DFS (X-1,Y-1);        DFS (X+1,Y+1);        DFS (X-1,Y+1);    DFS (X+1,Y-1);        }}int Main () {while (~scanf ("%d%d", &n,&m)) {if (n==0&&m==0) return 0;        int cnt=0;                for (int i=0;i<110;i++) for (int k=0;k<110;k++) {vis[i][k]=0;            c[i][k]=0;  } getchar (); There's a hole more. A space for (int i=0;i<n;i++) {for (int k=0;k<m;k++) {cin &G            T;> C[i][k]; }} for (int i=0;i<n;i++) {for(int k=0;k<m;k++)                    {if (c[i][k]== ' @ ' &&!vis[i][k])//not marked {cnt++;                DFS (I,K);    }}} printf ("%d\n", CNT); } return 0;}


Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

HDU (1241)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.