【HDU】 1312 Red and Black

Red and Black

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

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
  
  

题解：同前一题，Floodfill裸题。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;

struct node
{
    int x,y;
};
int way[4][2]={{0,-1},{0,1},{-1,0},{1,0}};
char s[25][25];
int n,m,x,y,flag[25][25];
queue<node> q;

int check(int x,int y)
{
    return s[x][y]!='#' && x>=0 && x<n && y>=0 && y<m && !flag[x][y];
}

int bfs(int x,int y)
{
    int ans=0;
    node t,r;
    t.x=x; t.y=y; flag[x][y]=1;
    q.push(t); ans++;
    while (!q.empty())
    {
        t=q.front(); q.pop();
        for (int i=0;i<4;i++)
        {
            r.x=t.x+way[i][0]; r.y=t.y+way[i][1];
            if (check(r.x,r.y))
            {
                q.push(r); flag[r.x][r.y]=1;
                ans++;
            }
        }
    }
    return ans;
}

int main()
{
    while (scanf("%d%d",&m,&n),n&&m)
    {
        memset(s,0,sizeof(s));
        memset(flag,0,sizeof(flag));
        for (int i=0;i<n;i++) scanf("%s",s[i]);
        for (int i=0;i<n;i++)
            for (int j=0;j<m;j++) if (s[i][j]=='@')
        {
            x=i; y=j; break;
        }
        printf("%d\n",bfs(x,y));
    }
    return 0;
}