리셋 되지 말자

#include #include using namespace std; queue Q; int *arr; int loc= -1; int start, target; void BFS(void) { loc = Q.front(); Q.pop(); if (loc == target) return; if (loc > 0) { if (arr[loc - 1] == 0) { arr[loc - 1] = arr[loc] + 1; Q.push(loc - 1); } } if (loc < 100000) { if (arr[loc + 1] == 0) { arr[loc + 1] = arr[loc] + 1; Q.push(loc + 1); } } if (2 * loc < 100001) { if (arr[2 * loc] == 0) { arr[..

#include #include #include using namespace std; queue Q; int day = 0; pair D[4] = { {-1, 0}, {0, 1}, {1, 0}, {0, -1} //위, 오른쪽, 아래, 왼쪽 }; int **make_array(int **arr, int col, int row) { arr = new int*[row]; for (int i = 0; i > arr[i][j]; if (arr[i][j] == 1) { Q.push(make_pair(i, j)); //co..