HDU 1312--Red and Black【DFS】
来源:互联网 发布:hive从本地导入数据 编辑:程序博客网 时间:2024/05/16 06:46
Red and Black
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11503 Accepted Submission(s): 7158
Problem 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)
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)
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 <cstdio>#include <cstring>int n,m;char map[100][100];int dir[][2]={0,1,0,-1,1,0,-1,0};int ans;void dfs(int x,int y){ map[x][y]='#'; for(int i=0;i<4;++i){ int fx=x+dir[i][0]; int fy=y+dir[i][1]; if(fx>=0 && fx<m && fy>=0 && fy<n && map[fx][fy]=='.'){ dfs(fx,fy); ans++; } }}int main (){ int i,j,sx,sy; while(scanf("%d%d",&n,&m),n,m){ for(i=0;i<m;++i){ scanf("%s",map[i]); for(j=0;j<n;++j){ if(map[i][j]=='@'){ sx=i,sy=j; } } } ans=0; dfs(sx,sy); printf("%d\n",ans+1); } return 0;}
0 0
- hdu 1312 Red and Black(dfs入门)
- hdu 1312 Red and Black dfs
- hdu 1312 Red and Black (简单dfs)
- hdu 题目1312 Red and Black ( DFS )
- HDU--1312 -- Red and Black [简单DFS]
- HDU 1312 Red and Black(BFS,DFS)
- HDU 1312 Red and Black (DFS入门)
- hdu 1312 Red and Black (bf、dfs)
- DFS-HDU 1312 -Red and Black
- hdu 1312 Red and Black(DFS)
- HDU--1312:Red and Black (DFS)
- HDU-#1312 Red and Black(DFS)
- HDU 1312 -- Red and Black(dfs)
- HDU 1312--Red and Black【DFS】
- HDU 1312Red and Black dfs
- hdu 1312 Red and Black(DFS)
- HDU - 1312 Red and Black (dfs)
- hdu 1312 Red and Black DFS
- HDOj-2209-翻纸牌游戏-DFS
- 使用wget工具抓取网页和图片
- JS 可变参数
- 窗口自动布局MFC(转发)
- 启动Tomcat6.x时manager does not exist or is not a readable directory
- HDU 1312--Red and Black【DFS】
- 第四周项目一——三角形类的构造函数(3)
- lua 提取 字符串操作 可以用在c 程序当中 2
- 多目录下多文件 makefile编写
- 一种 Roguelike 地牢生成算法
- GreenDao官方文档翻译
- R学习笔记
- 第三章作业
- Horspool 算法C++11实现(支持中英文混合搜索)