[#1012] 유기농 배추

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
 
using namespace std;
int m, n, k;
int cnt;
vector<vector<int>> map(51, vector<int>(51, 0));
vector<vector<bool>> visit(51, vector<bool>(51, false));
 
void dfs(int row, int col) {
    visit[row][col] = true;
 
    if (row - 1 >= 1 && !visit[row - 1][col] && map[row - 1][col] == 1)
        dfs(row - 1, col); //위
 
    if (row + 1 <= n && !visit[row + 1][col] && map[row + 1][col] == 1)
        dfs(row + 1, col); //아래
 
    if (col - 1 >= 1 && !visit[row][col - 1] && map[row][col - 1] == 1)
        dfs(row, col - 1); //왼쪽
 
    if (col + 1 <= m && !visit[row][col + 1] && map[row][col + 1] == 1)
        dfs(row, col + 1); //오른쪽
}
 
int main() {
    int t;
    scanf("%d", &t);
 
    for (int tc = 0; tc < t; tc++) {
        //각 테스트케이스마다 초기화
        cnt = 0;
        map = vector<vector<int>>(51, vector<int>(51, 0));
        visit = vector<vector<bool>>(51, vector<bool>(51, false));
 
        scanf("%d %d %d", &m, &n, &k);
 
        for (int i = 0; i < k; i++) {
            int a, b;
            scanf("%d %d", &a, &b);
 
            map[b + 1][a + 1] = 1;
        }
 
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (map[i][j] == 1 && !visit[i][j]) {
                    dfs(i, j);
                    ++cnt;
                }
            }
        }
 
        printf("%d\n", cnt);
    }
 
    return 0;
}

 

단지번호붙이기랑 똑같은 문제