hdu1312
来源:互联网 发布:epub手机阅读软件 编辑:程序博客网 时间:2024/06/01 09:03
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
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)
6 9....#......#..............................#@...#.#..#.11 9.#..........#.#######..#.#.....#..#.#.###.#..#.#..@#.#..#.#####.#..#.......#..#########............11 6..#..#..#....#..#..#....#..#..###..#..#..#@...#..#..#....#..#..#..7 7..#.#....#.#..###.###...@...###.###..#.#....#.#..0 0
4559613
DFS水题,看清题目要求即可
代码:
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stdio.h>
using namespace std;
int cnt;
int W,H;
int x,y;
char array[21][21];
int temp[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
void DFS(int a,int b)
{
cnt++;
array[a][b] = '#';
for(int i = 0;i < 4;i++)
{
int xx = temp[i][0] + a;
int yy = temp[i][1] + b;
if(xx >= 0&&xx < H&&yy >= 0 && yy < W&&array[xx][yy] == '.')
DFS(xx,yy);
}
return;
}
int main()
{
int i,j,k;
while(~scanf("%d%d",&W,&H))
{
if(W == 0&& H == 0)
break;
for(i = 0;i < H;i++)
{
for(j = 0;j < W;j++)
{
cin>>array[i][j];
if(array[i][j] == '@')
{
x = i,y = j;
}
}
}
cnt = 0;
DFS(x,y);
cout<<cnt<<endl;
}
return 0;
}
- hdu1312
- hdu1312
- HDU1312
- hdu1312
- hdu1312
- hdu1312
- hdu1312
- hdu1312
- hdu1312
- hdu1312
- hdu1312
- HDU1312
- HDU1312
- hdu1312
- hdu1312
- HDU1312
- hdu1312
- hdu1312深搜!!!
- 推荐系统概述7
- websocket原理浅析
- CSS:before和after中的content属性
- 进程间通信——管道通信
- 自己留存的一些东东
- hdu1312
- IDC机房ESXi5.0误删除虚拟机的数据恢复过程
- Android系统修改汇总(MTK)
- Mybatis中关于:Statement returned more than one row, where no more than one was expected.
- 我的第一个功能页面(下)
- 关于Android6.0以上动态获取运行时权限、及无法正常运行百度地图API的问题
- sql查询一对多时,多的只取某一个字段组装成json
- Android开发之Activity跳转动画以及finish动画
- 实现网页图片的异步加载