목록숨바꼭질 (1)

리셋 되지 말자

[백준 1697] 숨바꼭질

#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[..
알고리즘 2020. 3. 11. 16:08
Prev 1 Next