poj 1979 Red and Black (简单裸搜索)
来源:互联网 发布:思科网络技术学院4本书 编辑:程序博客网 时间:2024/05/22 03:12
Red and Black
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 28661 Accepted: 15616
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
4559613
Source
题目链接:http://poj.org/problem?id=1979
题目大意:'.'表示黑点,'#'表示红点,'@'表示一个人的起始位置,人只能在黑点上移动且可以往上下左右四个方向移动,求这个人最多能走的格子数。
解题思路:裸的深搜。
代码如下:
#include <cstdio>#include <cstring>int n,m;char a[25][25];int vis[25][25];int ans;int dx[4]={0,1,0,-1};int dy[4]={1,0,-1,0};void dfs(int x,int y){for(int i=0;i<4;i++){int nx=x+dx[i];int ny=y+dy[i];if(nx>=n || ny>=m || nx<0 ||ny<0 || vis[nx][ny])continue;if(a[nx][ny]=='#')continue;vis[nx][ny]=1;dfs(nx,ny);ans++;}}int main(void){while(scanf("%d%d",&m,&n)!=EOF && (n+m)){int sx,sy;ans=0;memset(vis,0,sizeof(vis));for(int i=0;i<n;i++){scanf("%s",a[i]);for(int j=0;j<m;j++)if(a[i][j]=='@'){sx=i;sy=j;}}vis[sx][sy]=1;a[sx][sy]='.';dfs(sx,sy);printf("%d\n",ans+1 );}}
0 0
- poj 1979 Red and Black (简单裸搜索)
- POJ 1979 Red and Black DFS搜索
- POJ 1979 Red and Black(搜索)
- POJ 1979 :Red and Black 搜索
- POJ 1979 Red and Black (简单dfs)
- POJ 1979 Red and Black (裸BFS)
- POJ 1979 Red and Black(BFS广度优先搜索)
- POJ 1979 Red and Black【深度优先搜索】
- Red and Black (POJ 1979,深度优先搜索)
- POJ 1979 Red and Black
- poj 1979 Red and Black
- POJ 1979 - Red and Black
- POJ-1979-Red and Black
- poj 1979 red and black
- poj 1979 Red and Black
- poj 1979 Red and Black
- POJ:1979 Red and Black
- POJ 1979 - Red and Black
- C++中为什么要用虚函数、指针或引用才能实现多态?
- Hive——用户自定义函数(UDF)
- android:taskAffinity与android:finishOnTaskLaunch之我见
- 性能优化之布局优化
- UIViewController的生命周期及iOS程序执行顺序
- poj 1979 Red and Black (简单裸搜索)
- oracle当前连接数,会话数
- 金融业IT员工,在总行做软件开发,职业发展道路真的很窄吗?
- struct和typedef struct
- 用Matlab批量生成图片
- 如何成为一个C++高级程序员
- Hust oj 2113 Count(Map)
- bzoj--1257--余数之和sum(数学)
- visual stdio 2010 安装包制作