인프런 커뮤니티 질문&답변

테스트 케이스는 다 맞고

코드도 틀린부분이 어딘지 모르겠습니다 ㅠㅠ

#include <iostream>
#include<string.h>
using namespace std;

const int MAX = 51;
const int dy[4] = { -1,1,0,0 };
const int dx[4] = { 0,0,-1,1 };

int T, N, M, K, cnt;
int adj[MAX][MAX];
bool visited[MAX][MAX];


void dfs(int y, int x)
{
	visited[y][x] = true;

	for (int i = 0; i < 4; i++)
	{
		int ny = y + dy[i];
		int nx = x + dx[i];

		if (ny < 0 || ny >= N || nx < 0 || ny >= M)
			continue;
		if (adj[ny][nx] == 0)
			continue;
		if (visited[ny][nx])
			continue;

		dfs(ny, nx);
	}
	return;
}


int main()
{
	cin >> T;

	for (int i = 0; i < T; i++)
	{
		cin >> M >> N >> K;

		cnt = 0;
		memset(visited, false, sizeof(visited));
		memset(adj, 0, sizeof(adj));

		for (int j = 0; j < K; j++)
		{
			int y, x;
			cin >> x >> y;
			adj[y][x] = 1;
		}

		for (int y = 0; y < N; y++)
			for (int x = 0; x < M; x++)
			{
				if (visited[y][x])
					continue;
				if (adj[y][x] == 1)
				{
					dfs(y, x);
					cnt++;
				}
			}

		cout << cnt << '\n';
	}

	

	return 0;
}