# poj1979(回溯)

Red and Black
 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 41029 Accepted: 22258

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)
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

#include<iostream>
using namespace std;
char map[25][25];
int visited[25][25];
int w,h,ans,ww,hh;
void search(int x,int y)
{
if(x>=0&&x<h&&y>=0&&y<w&&!visited[x][y]&&map[x][y]=='.')
{
visited[x][y]=1;
ans++;
search(x,y-1);
search(x,y+1);
search(x-1,y);
search(x+1,y);
}
}
int main()
{
while(cin>>w>>h&&(w||h))
{
ans=0;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>map[i][j];
visited[i][j]=0;
}
}
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
if(map[i][j]=='@')
{
hh=i;
ww=j;
map[i][j]='.';
}
}
}
search(hh,ww);
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{

cout<<visited[i][j];
}
cout<<endl;
}
cout<<ans<<endl;
}
return 0;
}
#include<iostream>
using namespace std;
char map[25][25];
int visited[25][25];
int w,h,ans,ww,hh;
void search(int x,int y)
{
if(x<0||x>=h||y<0||y>=w||visited[x][y]||map[x][y]=='#') return ;
visited[x][y]=1;
ans++;
search(x,y-1);
search(x,y+1);
search(x-1,y);
search(x+1,y);
}
int main()
{
while(cin>>w>>h&&(w||h))
{
ans=0;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>map[i][j];
visited[i][j]=0;
}
}
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
if(map[i][j]=='@')
{
hh=i;
ww=j;
}
}
}
search(hh,ww);
/*	for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{

cout<<visited[i][j];
}
cout<<endl;
}*/
cout<<ans<<endl;
}
return 0;
}

• 评论

• 上一篇
• 下一篇