거리두기 확인하기 C++

https://programmers.co.kr/learn/courses/30/lessons/81302?language=cpp

코딩테스트 연습 - 거리두기 확인하기

 

#include <string>
#include <vector>
#include <cstring>

using namespace std;
struct MOVE { int x, y; };
MOVE mv[4] = { { 1,0 },{ 0,1 },{ -1,0 },{ 0,-1 } };
bool flag = true;

void dfs(int visited[5][5], vector<string> tmp, int i, int j, int count) {
	if (count== 2) {
		return;
	}

	for (int k = 0; k<4; k++) {
		if (flag == false)    return;

		int movei = i + mv[k].x;
		int movej = j + mv[k].y;

		if (movei >= 0 && movei <5 && movej >= 0 && movej <5 && visited[movei][movej] == -1) {
			if (tmp[movei][movej] == 'P') {
				flag = false;
				return;
			}
			else if (tmp[movei][movej] == 'X') {
				continue;
			}
			else {
				visited[movei][movej] = 1;
				dfs(visited,tmp, movei, movej, count + 1);
			}
		}
	}
}

vector<int> solution(vector<vector<string>> places) {
	vector<int> answer;

	for (int k = 0; k<places.size(); k++) {
		vector<string> tmp = places[k];
		flag = true;
		
		for (int i = 0; i<5; i++) {
			for (int j = 0; j<5; j++) {

				if (tmp[i][j] == 'P') {
					int visited[5][5];
					memset(visited, -1, sizeof(visited));
					visited[i][j] = 1;
					dfs(visited,tmp, i, j, 0);
					if (flag == false) {
						answer.push_back(0);
						break;
					}
				}
			}
			if (flag == false)   break;
		}
		if (flag == true) {
			answer.push_back(1);
		}
	}
	return answer;
}