hdu 2952 田字格四个方向的深度优先搜索 计算连通分量
来源:互联网 发布:温州天勤网络怎么样 编辑:程序博客网 时间:2024/04/28 15:26
题目链接 点击打开链接
Counting Sheep
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2665 Accepted Submission(s): 1768
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
田字格的四个方向搜索
#include<iostream>#include<stdlib.h>#include<stdio.h>#include<stack>#include<string>#include<algorithm>using namespace std;#define maxn 105int dir[4][2] = {{-1 , 0} , {1 , 0} , {0 , -1} , {0 , 1} } ; //按照上下左右的顺序char arc[maxn][maxn] ;int h ,w ;void dfs(int x , int y){ // cout << "x = " <<x << "y = " << y << endl ; int nowx , nowy ; for(int i = 0 ; i<4 ; i++){ nowx = x + dir[i][0] ; nowy = y + dir[i][1] ; if(nowx != -1 && nowy != -1 && arc[nowx][nowy] == '#' ){ // cout << " dir i = " << i << endl; arc[nowx][nowy] = '.' ; dfs(nowx , nowy) ; // cout << "return x = " << x << "y = " << y << endl; } }}void solve(){ int cou = 0 ; for(int i = 0 ; i < h; i++){ for(int j = 0 ; j< w ; j++){ if(arc[i][j] == '#'){ arc[i][j] = '.' ; dfs(i , j) ; cou++ ; } } } cout << cou << endl;}int main(){ int t; cin>>t ; while(t--){ cin>>h >> w ; for(int i =0 ; i<h ; i++){ for(int j = 0 ; j<w ; j++ ){ cin >> arc[i][j] ; } } for(int i = 0 ; i<= h ; i++) arc[i][w] = '.' ; for(int i =0 ; i<= w ; i++) arc[h][i] = '.' ;// for(int i =0 ; i<=h ; i++){// for(int j = 0 ; j<=w ; j++ ){// printf("arc[%d][%d] = %c " , i ,j , arc[i][j] );// }// cout<<"\n" << endl;// } solve() ; } return 0 ;}
0 0
- hdu 2952 田字格四个方向的深度优先搜索 计算连通分量
- hdu 1241 田字格八个方向的深度优先搜索 求连通分量个数
- 通过深度优先搜索求强连通分量
- 图的邻接表和邻接矩阵的java实现(含深度优先搜索和广度优先搜索、强连通分量)
- 算法导论 第23章 广度优先搜索 深度优先搜索 拓扑排序 强连通分量 C++实现
- 【Java】利用单链表遍历、队列通过广度优先搜索算法来求各个的连通分量
- 图——连通分量与深度优先遍历
- hdu 6201 深度优先搜索
- 算法导论-第22章-基本的图算法:强连通分量(深度优先遍历基础上)C++实现
- poj 3620 求最大连通水池的个数(深度优先搜索)
- java版无向图的深度优先搜索,求连通图个数
- 深度优先搜索,DFS,UVA572,连通分支数
- C 用DFS(深度优先搜索)求连通块个数
- 【数据结构】以邻接矩阵作存储结构,求连通分量的个数,设计算法求图G的深度,深度优先序列输出
- 深度优先搜索和深度优先搜索的区别
- 图的深度优先搜索
- 图的深度优先搜索
- 图的深度优先搜索
- 数据库分库分表(sharding)系列(三) 关于使用框架还是自主开发以及sharding实现层面的考量
- List Arraylist linklist map 区别
- ANDROID垃圾回收器机制和强引用、软引用、弱引用、虚引用
- Middleware详解
- Android 图文混排
- hdu 2952 田字格四个方向的深度优先搜索 计算连通分量
- The Zen of Python
- 数据库分库分表(sharding)系列(四) 多数据源的事务处理
- 数据库设计细节问题
- editbox点击空白隐藏键盘
- (三)数字判断大小语句
- PHP远程获取网页内容
- domino纯前台分页功能实现
- 深入理解流,什么是流?