HDU2952:Counting Sheep(DFS)
来源:互联网 发布:三国杀手游源码 编辑:程序博客网 时间:2024/04/27 21:18
Problem Description
A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone to bed. As always when my grandmother suggests things, I decided to try it out. The only problem was, there were no sheep around to be counted when I went to bed.
Creative as I am, that wasn't going to stop me. I sat down and wrote a computer program that made a grid of characters, where # represents a sheep, while . is grass (or whatever you like, just not sheep). To make the counting a little more interesting, I also decided I wanted to count flocks of sheep instead of single sheep. Two sheep are in the same flock if they share a common side (up, down, right or left). Also, if sheep A is in the same flock as sheep B, and sheep B is in the same flock as sheep C, then sheeps A and C are in the same flock.
Now, I've got a new problem. Though counting these sheep actually helps me fall asleep, I find that it is extremely boring. To solve this, I've decided I need another computer program that does the counting for me. Then I'll be able to just start both these programs before I go to bed, and I'll sleep tight until the morning without any disturbances. I need you to write this program for me.
Creative as I am, that wasn't going to stop me. I sat down and wrote a computer program that made a grid of characters, where # represents a sheep, while . is grass (or whatever you like, just not sheep). To make the counting a little more interesting, I also decided I wanted to count flocks of sheep instead of single sheep. Two sheep are in the same flock if they share a common side (up, down, right or left). Also, if sheep A is in the same flock as sheep B, and sheep B is in the same flock as sheep C, then sheeps A and C are in the same flock.
Now, I've got a new problem. Though counting these sheep actually helps me fall asleep, I find that it is extremely boring. To solve this, I've decided I need another computer program that does the counting for me. Then I'll be able to just start both these programs before I go to bed, and I'll sleep tight until the morning without any disturbances. I need you to write this program for me.
Input
The first line of input contains a single number T, the number of test cases to follow.
Each test case begins with a line containing two numbers, H and W, the height and width of the sheep grid. Then follows H lines, each containing W characters (either # or .), describing that part of the grid.
Each test case begins with a line containing two numbers, H and W, the height and width of the sheep grid. Then follows H lines, each containing W characters (either # or .), describing that part of the grid.
Output
For each test case, output a line containing a single number, the amount of sheep flock son that grid according to the rules stated in the problem description.
Notes and Constraints
0 < T <= 100
0 < H,W <= 100
Notes and Constraints
0 < T <= 100
0 < H,W <= 100
Sample Input
24 4#.#..#.##.##.#.#3 5###.#..#..#.###
Sample Output
63简单DFS,跟1241挺类似的,貌似还要简单一些#include<stdio.h>#include<string.h>char map[110][110];int vis[110][110];int w,h;void dfs(int x,int y){if(x<0||y<0||x>=w||y>=h)return;if(vis[x][y])return;if(map[x][y]=='.')return;vis[x][y]=1;dfs(x,y+1);dfs(x,y-1);dfs(x+1,y);dfs(x-1,y);}int main(){int t,cnt;scanf("%d",&t);while(t--){scanf("%d%d",&w,&h);for(int i=0;i<w;++i)scanf("%s",map[i]);memset(vis,0,sizeof(vis));cnt=0;for(int i=0;i<w;++i)for(int j=0;j<h;++j)if(!vis[i][j]&&map[i][j]=='#'){dfs(i,j);cnt++;}printf("%d\n",cnt);}return 0;}
0 0
- HDU2952:Counting Sheep(DFS)
- hdu2952(DFS Counting Sheep )
- HDU2952:Counting Sheep(DFS)
- HDU2952 Counting Sheep (DFS)
- HDU2952:Counting Sheep(DFS)
- HDU2952 Counting Sheep (DFS)
- HDU2952 (DFS) Counting Sheep
- HDU2952 ( Counting Sheep )
- HDU2952:Counting Sheep(BFS)
- HDU2952 Counting Sheep
- HDU2952:Counting Sheep(BFS)
- hdu2952 Counting Sheep
- hdu2952(Counting Sheep )
- Counting Sheep(HDU2952)
- Hdu2952 Counting Sheep
- hdu2952 Counting Sheep
- hdu2952 Counting Sheep
- hdu2952 Counting Sheep 深搜
- php文件操作
- HashMap Hashtable区别
- 大学,助你成长or 让你堕落?
- Ubuntu命令行下安装,卸载软件包的过程
- 走路,别忘记回头
- HDU2952:Counting Sheep(DFS)
- 并行编程之多线程共享非volatile变量,会不会可能导致线程while死循环
- ACdream1020:The Game about KILL
- 正则表达式
- ubuntu使用命令行下载文件
- Eclipse NDK 配置
- 分支-01. 超速判断(10)
- POJ 1179 Polygon(最优矩阵链乘)
- Linux 下怎么用命令修改分辨率