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): 8756    Accepted Submission(s): 5426

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<iostream>
#include<cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn=100+10;
int map[maxn][maxn],vis[maxn*maxn];
int n,m;
int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int ans;
queue<int>q;
void bfs(int c)
{
	q.push(c);
	vis[c]=1;
	while(!q.empty())
	{
		int temp=q.front();
		q.pop();
		int a=temp/m;
		int b=temp%m;
		for(int i=0;i<4;i++)
		{
			int newx=a+d[i][0];
			int newy=b+d[i][1];
			int t=newx*m+newy;
			if(newx>=0&&newx<n&&newy>=0&&newy<m&&(!vis[t])&&(map[newx][newy]==1))
			{
				vis[t]=1;
				q.push(t);
				ans++;
			}
		}
	}
}
int main()
{
	char ch;
	int start;
	while(scanf("%d%d",&m,&n)&&n&&m)
	{
		while(!q.empty())
			q.pop();
		memset(vis,0,sizeof(vis));
		ans=1;
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				cin>>ch;
				if(ch=='.')
					map[i][j]=1;
				if(ch=='#')
					map[i][j]=0;
				if(ch=='@')
					start=i*m+j;
			}
		}
		bfs(start);
		printf("%d\n",ans);
	}
	return 0;
}