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
2 4 4 #.#. .#.# #.## .#.# 3 5 ###.# ..#.. #.###
Sample Output
63
简单来说就是数羊群,羊上下左右为相邻区域
//找到一只羊,然后搜索,将周围所有羊都变成草 //在主循环中判断羊群数目 //有羊则搜索,羊群数量+1;
#include <iostream> #include <stdio.h> #include <string.h> #include <fstream> #define maxn 110 char ma[maxn][maxn]; int vis[maxn][maxn]; int p[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}}; int H, W; using namespace std; //应该是做过类似题目的 //找到一只羊,然后搜索,将周围所有羊都变成草 //在主循环中判断羊群数目 //有羊则搜索,羊群数量+1; void dfs(int h, int l) { //ma[h][l]有边界 if(ma[h][l] != '#') return; //不用vis,直接用地图标记 ma[h][l] = '.'; for(int i = 0; i < 4; i++) { int x = h + p[i][0]; int y = l + p[i][1]; if(x >= 0 && x < H && y >= 0 && y < W) dfs(x, y); } return; } int main() { //freopen("in.txt", "r", stdin); int t; scanf("%d", &t); while(t) { t--; scanf("%d%d", &H, &W); //阿西!输入完整数后面会有一个换行符,要用getchar getchar(); for(int i = 0; i < H; i++) { for(int j = 0; j < W; j++) { scanf("%c", &ma[i][j]); } getchar(); } //memset(vis, 0, sizeof(vis)); int num = 0; for(int i = 0; i < H; i++) { for(int j = 0; j < W; j++) { if(ma[i][j] == '#') { num++; dfs(i, j); } } } printf("%d\n", num); } return 0; }