Red and Black
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 41100 | Accepted: 22295 |
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.
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)
The end of the input is indicated by a line consisting of two zeros.
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)
The end of the input is indicated by a line consisting of two zeros.
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
import java.util.*;
public class Main {
static int [][]a;
static int count;
static boolean [][]vis;
static int []dx={0,0,1,-1};
static int []dy={1,-1,0,0};
static int h,w;
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
while(in.hasNext())
{
count=1;
w=in.nextInt();
h=in.nextInt();
int x=0,y=0;
if(w==0&&h==0)return;
a=new int[h][w];
vis=new boolean[h][w];
for(int i=0;i<h;i++)
{
String str=in.next();
for(int j=0;j<w;j++)
{
if(str.charAt(j)=='.')
{
a[i][j]=0;
}
if(str.charAt(j)=='#')
{
a[i][j]=1;
}
if(str.charAt(j)=='@')
{
a[i][j]=2;
x=i;
y=j;
}
}
}
dfs(x,y);
System.out.println(count);
}
}
public static void dfs(int x,int y)
{
for(int i=0;i<4;i++)
{
if(x+dy[i]>=0 && x+dy[i]<h && y+dx[i]>=0 && y+dx[i]<w)
{
if(a[x+dy[i]][y+dx[i]]==0 && vis[x+dy[i]][y+dx[i]]==false)
{
vis[x+dy[i]][y+dx[i]]=true;
count++;
dfs(x+dy[i],y+dx[i]);
}
}
}
}
}