POJ - 1979:Red and Black
11684 ワード
Red and Black
出典:POJ
ラベル:
参考資料:
類似タイトル:
タイトル
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.
入力
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.
しゅつりょく
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).
入力サンプル
出力サンプル
45 59 6 13
リファレンスコード
出典:POJ
ラベル:
参考資料:
類似タイトル:
タイトル
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.
入力
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.
しゅつりょく
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).
入力サンプル
6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0
出力サンプル
45 59 6 13
リファレンスコード
#include
int row,col;
const int maxn=25;
char arr[maxn][maxn];
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};//
int ans;
void dfs(int x,int y)
{
arr[x][y]='@';
for(int i=0;i<4;i++)
{
int nx=x+dx[i],ny=y+dy[i];
if(0<=nx && nx<row && 0<=ny && ny<col && arr[nx][ny]=='.')
{
ans++;
dfs(nx,ny);
}
}
}
int main()
{
while(scanf("%d%d",&col,&row)==2)
{
if(row==0 && col==0) break;
while(getchar()!='
');//
int i,j;
int posx,posy;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
arr[i][j]=getchar();
//
if(arr[i][j]=='@')
{
posx=i;
posy=j;
}
}
while(getchar()!='
');
}
ans=0;//
dfs(posx,posy);
printf("%d
",ans+1);
}
return 0;
}