1012 유기농 배추

#include <stdio.h>
#include <queue>
#include <string.h>
 
using namespace std;
 
int house[55][55] = { 0 };
int val, n;
 
void find(int i, int j);
 
int main() {
    int t;
    scanf("%d", &t);
 
    while (t--) {
        int m, n, k;
        scanf("%d %d %d", &m, &n, &k);
 
        priority_queue<int> q;
 
        for (int i = 1; i <= k; i++) {
            int a, b;
            scanf("%d %d", &a, &b);
 
            house[b][a] = 1;
        }
 
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (house[i][j] == 1) {
                    val = 1;
                    house[i][j] = 0;
 
                    find(i, j);
                    q.push(-val);
                }
            }
        }
 
        printf("%d\n", q.size());        
        
        for (int i = 0; i <= 55; i++) {
            memset(house[i], 0, sizeof(int) * 55);        
        }
    }    
}
 
void find(int i, int j) {
    house[i][j] = 0;
    
    if (i>=1 && house[i - 1][j] == 1) {
        val++;
        house[i - 1][j] == 0;
        
        find(i - 1, j);
    }
    if (j >= 1 && house[i][j - 1] == 1) {
        val++;
        house[i][j - 1] == 0;
        
        find(i, j-1);
    }
    if (house[i+1][j] == 1) {
        val++;
        house[i + 1][j] == 0;
        
        find(i + 1, j);
    }
    if (house[i][j+1] == 1) {
        val++;
        house[i][j + 1] == 0;
        
        find(i, j+1);
    }
 
    return;
}