[poj] 1979 Red and Black [dfs]
来源:互联网 发布:java程序开发培训机构 编辑:程序博客网 时间:2024/06/06 06:57
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 Input6 9....#......#..............................#@...#.#..#.11 9.#..........#.#######..#.#.....#..#.#.###.#..#.#..@#.#..#.#####.#..#.......#..#########............11 6..#..#..#....#..#..#....#..#..###..#..#..#@...#..#..#....#..#..#..7 7..#.#....#.#..###.###...@...###.###..#.#....#.#..0 0Sample Output4559613
dfs入门题
#include<cstdio>#include<string>#define MAX_N 22using namespace std;char _map[MAX_N][MAX_N];int h,w,cnt;int s_x,s_y;int ox[]={0,0,1,-1};int oy[]={1,-1,0,0};int dfs(int X,int Y){ cnt++; _map[X][Y]='N';//随便用个什么 标记一下走过的 for(int i=0;i<4;i++){ int x=X+ox[i]; int y=Y+oy[i]; if(0<=x&&x<h&&0<=y&&y<w&&_map[x][y]=='.') dfs(x,y); }}int main(){ while(~scanf("%d%d",&w,&h)&&(w||h)){ for(int i=0;i<h;i++) scanf("%s",_map[i]); for(int j=0;j<h;j++) for(int k=0;k<w;k++) if(_map[j][k]=='@') s_x=j,s_y=k; cnt=0;dfs(s_x,s_y); printf("%d\n",cnt); } return 0;}
- poj 1979Red and Black(BFS DFS)
- poj 1979 Red and Black ---DFS
- POJ 1979 Red and Black (DFS)
- poj 1979 Red and Black (DFS)
- poj 1979 Red and Black(DFS)
- POJ 1979 Red and Black(DFS)
- POJ 1979 Red and Black DFS搜索
- poj 1979 Red and Black (DFS)
- poj 1979 Red and Black -dfs,回溯
- poj 1979 Red and Black(dfs)
- POJ 1979 Red and Black (DFS)
- POJ 1979 Red and Black (DFS)
- POJ 1979 Red and Black (dfs)
- POJ 1979 Red and Black (DFS)
- poj 1979 Red and Black 【dfs】
- POJ 1979 Red and Black(dfs)
- POJ 1979 Red and Black(dfs)
- POJ 1979-Red and Black【基础DFS】
- 代理模式
- 基于Struts2 Oracle分页
- Thinkphp框架引入外部文件不生效
- jira整合cas问题
- RelativeLayout布局小坑坑
- [poj] 1979 Red and Black [dfs]
- SSH框架如何配合使用
- 1692 魔板
- 鸟哥的linxu私房菜博客目录
- 开源实时日志分析ELK平台部署
- 查找算法
- 团体程序设计天梯赛L2-005 集合相似度
- Pigeon中的Netty应用
- Tegra K1问题记录