코드#include #include #include #include using namespace std;const int dx[] = { 0,0,1,-1 };const int dy[] = { 1,-1,0,0 };int n, m, a[103][103], visited[103][103], res;vector> v;vector > me;// 치즈 탐색void dfs(int x, int y) { visited[x][y] = 1; for (int i = 0; i = n || ny >= m || nx pa : v) { int x = pa.first; int y = pa.second; int tmp = 0; for (int i = 0; i = n || ny >= m || nx = 2) me.push_back..
치즈
코드#include using namespace std;int n,m,res,timecnt;int graph[104][104];int visited[104][104];int dx[] = {1,-1,0,0};int dy[] = {0,0,1,-1};vector> cheeze;void dfs(int x, int y) { visited[x][y] = 1; for(int i = 0; i = n || ny >= m || nx > n >> m; for(int i = 0; i > graph[i][j]; } } while(1) { timecnt++; dfs(0,0); int temp = cheeze.size(); for(int i = 0; i 풀이구멍에서는 치즈가 녹지 않으므로 바깥쪽..
