문제링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5VwAr6APYDFAWu
문제링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PoOKKAPIDFAUq ✔ 내 풀이임의로 한 곳을 1~k만큼 공사그 상태로 DFS=> O(n^4).
https://www.acmicpc.net/problem/14889
문제링크 : https://www.acmicpc.net/problem/15683