hdu1312 dfs

最新推荐文章于 2022-01-13 00:13:14 发布

想要她抱我

最新推荐文章于 2022-01-13 00:13:14 发布

阅读量108

点赞数

本文链接：https://blog.csdn.net/weixin_46285832/article/details/107344366

版权

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)

Sample Input

http://acm.hdu.edu.cn/showproblem.php?pid=1312

dfs一步一步遍历搜索直到搜索完为止

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <map>
#include <cmath>
#include<stack>
#include <set>
#include <queue>
#include <sstream>
#include <algorithm>
typedef long long ll;
using namespace std;
int h,w;
char a[22][22];
bool vis[22][22];
int MOVE[4][2]{
   {1,0},
   {0,1},
   {-1,0},
   {0,-1},
};
// 判断是否越界或者访问过了
/*bool ok(int nx,int ny){
   if(nx<0||ny<0||nx>h-1||ny>w-1) return false;
   if(vis[nx][ny]==1) return false;
   if(a[nx][ny]=='#')return false;
   return true;
}*/
// 用dfs一个个去访问
void dfs(int x,int y){
   if (a[x][y]=='#') return ;
   if (vis[x][y]==1) return ;
   if (x<1||x>w||y<1||y>h) return ;
   vis[x][y]=1;
   for(int i=0;i<4;i++){
       int nx=x+MOVE[i][0];
       int ny=y+MOVE[i][1];
       dfs(nx,ny);
   }

}
int main()
{
while(~scanf("%d %d",&h,&w)){
   if(h==0&&w==0){
       break;
       }
       memset(vis,0,sizeof vis);
       for(int i=1;i<=w;i++){
           for(int j=1;j<=h;j++){
               cin>>a[i][j];
           }
       }
       for(int i=1;i<=w;i++){
           for(int j=1;j<=h;j++){
               if(a[i][j]=='@') dfs(i,j);
           }
       }
       int ans=0;
       for(int i=1;i<=w;i++){
           for(int j=1;j<=h;j++){
               if(vis[i][j]==1) ans++;
           }
       }
       cout<<ans<<endl;;

   }
}