[C++] [DFS] 백준 1012번 : 유기농 배추

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

1012번: 유기농 배추

#include<utility>
#include<iostream>
using namespace std;
int path;
int M, N, K;		//가로 세로 배추몇개
int map[50][50];
int direct[4][2] = { {1,0},{-1,0},{0,1},{0,-1} };

void dfs(pair<int,int> x) {
	if (map[x.first][x.second] != 1)	return;
	map[x.first][x.second] = path;

	for (int i = 0; i < 4; i++) {
		int dy = x.first + direct[i][0];
		int dx = x.second + direct[i][1];

		if (0 <= dx && dx < M && 0 <= dy && dy < N && map[dy][dx] == 1)
			dfs(make_pair(dy, dx));
	}
}
void findCabbage() {
	pair<int, int> Start;
	while (1) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				if (map[i][j] == 1) {
					Start = make_pair(i, j);
					goto EXIT;
				}
				if (i == N - 1 && j == M - 1)
					return;
			}
		}
	EXIT:
		dfs(Start);
		path++;
	}
}
int main(void) {
	int T;
	cin >> T;
	while (T-- > 0) {
		path = 2;
		int x, y;
		cin >> M >> N >> K;

		for (int i = 0; i < K; i++) {
			cin >> x >> y;
			map[y][x] = 1;
		}

		findCabbage();

		cout << path - 2 << endl;

		
	}
}