bfs counting sheeps
来源:互联网 发布:python开发工具 编辑:程序博客网 时间:2024/06/04 23:26
Counting Sheep
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 7 Accepted Submission(s) : 4
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
Source
代码:
#include <iostream>#include<cstdio>#include<string.h>using namespace std;char map[101][101];int vis[101][101];int m,n,ans;void bfs(int i,int j){ if(map[i][j]=='#'&&i>=0&&i<m&&j>=0&&j<n&&vis[i][j]==0) { vis[i][j]=1; bfs(i+1,j); bfs(i-1,j); bfs(i,j+1); bfs(i,j-1); }}int main(){ int t; cin>>t; while(t--) { ans=0; memset(vis,0,sizeof(vis)); cin>>m>>n; for(int i=0;i<m;i++) for(int j=0;j<n;j++) cin>>map[i][j]; for(int i=0;i<m;i++) for(int j=0;j<n;j++) if(map[i][j]=='#'&&vis[i][j]==0) { ans++; bfs(i,j); } cout<<ans<<endl; } return 0;}
0 0
- bfs counting sheeps
- HDU2952:Counting Sheep(BFS)
- HDU2952:Counting Sheep(BFS)
- PAT1004. Counting Leaves bfs
- counting sheep bfs wyk
- poj 2386 Lake Counting (BFS~)
- POJ 2386 Lake Counting-------BFS
- 【BFS】-POJ-2386-Lake Counting
- Poj 2386 Lake Counting【Bfs】
- 【BFS】poj 2386 Lake Counting
- 1004. Counting Leaves (30)[bfs]
- poj 2386Lake Counting(DFS, BFS)
- poj 2386Lake Counting(BFS搞定)
- poj 2386 Lake Counting 解题报告(BFS)
- UVa 11244 counting stars ( 搜索 BFS)
- 1004. Counting Leaves (30) PAT+BFS
- POJ2386 Lake Counting BFS判断图连通
- POJ 2386 Lake Counting (DFS or BFS)
- 坚持,坚持,坚持
- Hard Fault 异常调试方法
- makefile
- hive学习之二:hive sql使用总结及遇到的问题
- 线程控制-sigwait函数和相关函数解释
- bfs counting sheeps
- 编译测试dll的范例出错
- 15校赛
- PHP简单工厂设计模式,简单代码。(缺点请指正,互相学习)
- HashMap深度解析(一)
- Java程序初始化的顺序
- hdu_2446_Shell Pyramid(数学,二分)
- telnet命令使用示例
- 名言警句一览