A - Red and Black(3.2.1)(搜索)
来源:互联网 发布:图片数据库 编辑:程序博客网 时间:2024/06/07 18:08
A - Red and Black(3.2.1)
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uDescription
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
#include<iostream>#include<cstring>using namespace std;int b,c,k,i,s,x,y,n;char a[21][21]; int sousuo(int x,int y,int a1,int b){int n=0;if(x>0)if(a[x-1][y]=='.'){n++;a[x-1][y]='a';n=n+sousuo(x-1,y,a1,b);} if(y>0)if(a[x][y-1]=='.'){n++;a[x][y-1]='a';n=n+sousuo(x,y-1,a1,b);}if(x<a1) if(a[x+1][y]=='.'){n++;a[x+1][y]='a';n=n+sousuo(x+1,y,a1,b);} if(y<b)if(a[x][y+1]=='.'){n++;a[x][y+1]='a';n=n+sousuo(x,y+1,a1,b);}return n;}int main(){int j;while(cin>>k>>s&&k){memset(a,'q',sizeof(a)); for(i=0;i<s;i++) for(j=0;j<k;j++) { cin>>a[i][j]; if(a[i][j]=='@') x=i,y=j; } n=sousuo(x,y,s,k); cout<<++n<<endl;}return 0;}
0 0
- A - Red and Black(3.2.1)(搜索)
- Red and Black(搜索)
- A - Red and Black(3.2.1)
- A - Red and Black(3.2.1)
- A - Red and Black(3.2.1)(小递归)
- Red and Black 搜索
- 搜索1(广度优先)Red and Black
- hdu 1312 Red and Black(搜索)
- hdu1312 Red and Black(简单搜索)
- HDU 1312 Red and Black(搜索)
- POJ 1979 Red and Black(搜索)
- hdu1312 Red and Black(搜索基础)
- Red and Black(搜索题目)
- POJ1079 Red and Black(搜索)
- HDU1312 Red and Black 搜索
- 【搜索-DFS】Red and Black
- poj1979 Red and Black【搜索】
- 北大ACM1979 - Red and Black (广度优先搜索)
- HDU 2807 The Shortest Path(矩阵相乘+Floyd)
- lucene、solr中的日期衰减方法-------function query --尚未测试在solr4.8
- 题目1388:跳台阶
- UVa12541 - Birthdates(排序)
- Android Layout布局文件里的android:layout_height等属性为什么会不起作用?
- A - Red and Black(3.2.1)(搜索)
- [LeetCode] Implement strStr()
- 马踏棋盘(简单广搜)
- Android NDK-STACK Tool
- 遍历出基础教程视频文件夹里所有视频名称
- 黑马程序员——异常处理
- RabbitMq的配置
- Linux下的目录创建命令使用实践
- 题目1389:变态跳台阶