백준 1012번 유기농 배추

#include <iostream>
#include <vector>

using namespace std;

vector<int> m, n, k;
bool graph[51][51];

bool dfs(int x, int y, int num) {
	if (x <= -1 || x >= m[num] || y <= -1 || y >= n[num])
		return false;

	if (graph[x][y] == true) {
		graph[x][y] = false;

		dfs(x - 1, y, num);
		dfs(x + 1, y, num);
		dfs(x, y - 1, num);
		dfs(x, y + 1, num);

		return true;
	}
	return false;
}

int main() {
	int t;
	cin >> t;

	m.resize(t);
	n.resize(t);
	k.resize(t);
	vector<int> result(t);
	
	for (int i = 0; i < t; ++i) {
		cin >> m[i] >> n[i] >> k[i];

		int x, y;
		for (int j = 0; j < k[i]; ++j) {
			cin >> x >> y;
			graph[x][y] = true;
		}
		
		for (int x = 0; x < m[i]; ++x)
			for (int y = 0; y < n[i]; ++y)
				if (dfs(x, y, i))
					++result[i];
	}

	for (int a : result)
		cout << a << endl;

	return 0;
}

범위를 잘 설정하자

 

https://www.acmicpc.net/problem/1012

1012번: 유기농 배추