HDU 1312 Red and Black
2015-07-14 10:03
134 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
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).
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
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).
[align=left]Sample Input[/align]
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
[align=left]Sample Output[/align]
45 59 6 13#include <stdio.h> #include <string.h> int n,m,cnt; char map[30][30]; int to[4][2] = {{1,0},{0,1},{-1,0},{0,-1}}; void dfs(int i,int j) { cnt++; map[i][j] = '#'; for(int k = 0; k<4; k++) { int x = i+to[k][0]; int y = j+to[k][1]; if(x<n && y<m && x>=0 && y>=0 && map[x][y] == '.') dfs(x,y); } return; } int main() { int i,j,fi,fj; while(~scanf("%d%d%*c",&m,&n)) { if(m == 0 && n == 0) break; for(i = 0; i<n; i++) { for(j = 0; j<m; j++) { scanf("%c",&map[i][j]); if(map[i][j] == '@') { fi = i; fj = j; } } getchar(); } cnt = 0; //map[i][j] = '#'; dfs(fi,fj); printf("%d\n",cnt); } return 33; }
相关文章推荐
- 小城大事
- jquery checkbox 显示checked undefined
- 通过浏览器链接启动本地activity
- Display tag library 1.2
- 头文件中#ifndef后面的如何写及什么作用
- EASY_SIZE使用
- struts2学习笔记(7)---数据验证之validateXxx()方法
- 未完的歌
- Foundation 框架之——NSDictionary、NSMutableDictionary
- 悟空学Linux专栏----第27篇
- ppt用什么方法可以转换成pdf
- Oracle:让PL/SQL Developer记住登陆密码
- Quick小白书系列(二)创建自己的项目并做点有意思的小内容
- Step into Kotlin - 12 - Object 与枚举
- ViewAnimator 之(三) ViewAnimator及其子类分析
- HDU 1241 Oil Deposits
- 中国特色的流程需求
- linux下svn常用指令
- TP-LINK WR841N V8刷OpenWRT
- Quick小白书系列(一)Quick的基本结构及如何开始入门