HDU 1312 Red and Black

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=1312

Red and Black

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

Problem Description

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.

 

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)

 

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

 

Sample Input

  
  

   
   6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0
  
  

 

Sample Output

  
  

   
   45
59
6
13
  
  

 

Source

Asia 2004, Ehime (Japan), Japan Domestic 

累，不想解释思路了，深搜水题。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<map>
#include<list>
#include<set>
#include<queue>
#define LL long long
using namespace std;
const int maxn=1005,maxe=100005,inf=1<<29;
int dir[][2]=
{
    {0,1},{-1,0},{0,-1},{1,0}
};
char Map[maxn][maxn];
int n,m,Max,ans;
void dfs(int x,int y)
{
    for(int i=0;i<4;i++)
    {

        int nx=dir[i][0]+x,ny=dir[i][1]+y;
        if(0<=nx&&nx<n&&0<=ny&&ny<m&&Map[nx][ny]=='.')
        {
          //  printf("1\n");
            Map[nx][ny]='#';
            ans++;
            dfs(nx,ny);
        }
    }
}
int main()
{
    while(~scanf("%d%d",&m,&n)&&(n+m))
    {
        ans=1;
        int Max=0,sx,sy;
        for(int i=0;i<n;i++) scanf("%s",Map[i]);
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            if(Map[i][j]=='@') sx=i,sy=j;
        //printf("sx=%d sy=%d\n",sx,sy);
        Map[sx][sy]='#',dfs(sx,sy);
        printf("%d\n",ans);
    }
    return 0;
}