counting sheep hdu 2952

dfs四个方向搜索

#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include <bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<vector>
#include<cmath>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
typedef unsigned long long ull;

int t, h, w;
char mat[105][105];
int direc[4][2] = { {0,1},{1,0},{-1,0},{0,-1} };
int visited[105][105];
int sum;

void dfs(int p,int q) {
    for (int k = 0; k < 4; k++) {            
        int nl = p + direc[k][0];
        int nr = q + direc[k][1];
        if (1 <= nl && nl <= h && 1 <= nr && nr <= w && visited[nl][nr] == 0 && mat[nl][nr] == '#') {
            visited[nl][nr] = 1;
            dfs(nl, nr);
        }
            
        
    }
}
int main() {
    cin >> t;
    while (t--) {
        cin >> h >> w;
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                cin >> mat[i][j];
            }
        }
        memset(visited, 0, sizeof(visited));
        sum = 0;
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                if (mat[i][j] == '#' && visited[i][j] == 0) {
                    visited[i][j] = 1;
                    dfs(i, j);
                    sum++;
                }
            }
        }
        cout << sum << endl;
    
    }
    return 0;
}