POJ 1979 && HDU 1312 Red and Black(DFS)
来源:互联网 发布:淘宝网首页包 编辑:程序博客网 时间:2024/03/29 15:43
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
#include <iostream>#include <cstdio>using namespace std;char map[25][25];int num;int w,l;//w->width l->lenthint dx[4] ={0,0,1,-1};int dy[4] ={1,-1,0,0};void dfs(int x,int y){ int i,xx,yy; for(i=0;i<4;i++) { xx = x+dx[i]; yy = y+dy[i]; if(xx>=0 && xx<w && yy>=0 && yy<l && map[xx][yy]=='.') { num++; map[xx][yy] = '@'; dfs(xx,yy); } }}int main(){ //freopen("test.txt","r",stdin); int i,j; int sx,sy; while(cin>>l>>w && l) { for(i=0;i<w;i++) { for(j=0;j<l;j++) { cin>>map[i][j]; if(map[i][j]=='@') { sx = i; sy = j; }// } } map[sx][sy] = '#'; num = 1; dfs(sx,sy); cout << num << endl; } //cout << "Hello world!" << endl; return 0;}
0 0
- POJ 1979 && HDU 1312 Red and Black(DFS)
- Poj 1979 Hdu 1312 Red and Black【dfs】
- POJ-1979&&HDU-1312--Red and Black---DFS深搜
- hdu 1312 Red and Black && POJ 1979 Red and Black
- 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)
- HDU 1312 -- Red and Black(dfs)
- Android Handler机制 (一个Thead中可以建立多个Hander,通过msg.target保证MessageQueue中的每个msg交由发送message的handler进行处理 ,但是
- DeepLearning学习笔记(一) 搭建环境
- i++原理分析
- npm 安装权限问题,在安装命令前加上,sudo即可
- 总结与备忘:nginx与php-fpm与php
- POJ 1979 && HDU 1312 Red and Black(DFS)
- kindeditor的使用方法简单介绍
- swift闭包--简明代码理解
- 修改oracle字符集将字符编码WE8MSWIN1252修改为AL32UTF8
- Android Listview 隐藏滚动条
- Android基础和运行机制
- iOS动态分享收藏举报弹出框
- 程序使用微软雅黑作为默认字体在xp下的问题
- 2015 Objective-C 三大新特性 不可错过的iOS开发技巧