문제: 6118번: 숨바꼭질 basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com //#include #include #include #include #include #include #include #include #include #include #inclu..

문제: 1325번: 효율적인 해킹 basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com #include using namespace std;vector> graph;vector check;int BFS(int start) { int tmpCnt = 0;..

문제: 1389번: 케빈 베이컨의 6단계 법칙 basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com //#include #include #include #include #include #include #include #include #include #incl..

문제: 2660번: 회장뽑기basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture basic-algo-lecture/workbook/0x18.md at master · encrypted-def/basic-algo-lecture바킹독의 실전 알고리즘 강의 자료. Contribute to encrypted-def/basic-algo-lecture development by creating an account on GitHub.github.com //#include #include #include #include #include #include #include #include #include #include #includ..

문제: 16948번: 데스 나이트 #include using namespace std;vector> board;vector> visits;int dx[6] = { -2, -2, 0, 0, 2, 2 };int dy[6] = { -1, 1, -2, 2, -1, 1 };int n;int r1, c1, r2, c2;vector> path;void BFS() { queue> nexts; visits[r1][c1] = 1; nexts.push({ r1, c1 }); while (!nexts.empty()) { pair cur = nexts.front(); nexts.pop(); for (int i = 0; i n - 1 || ny n - 1) continue; ..

문제: 6593번: 상범 빌딩 //#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;vector>> building;vector>> visits;queue> nexts;int l, r, c; // 층 수, 행, 열int time_ = 0;// 동, 서, 남, 북, 상, 하 (총 6방향)int dx[6] = { 1, -1, 0, 0, 0, 0 };int dy[6] = { 0, 0, 1, -1, 0, 0 };int dz[6] = { 0, 0, 0, 0, 1, -1 };..

문제: 3055번: 탈출 //#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;vector> world;vector> visits;queue> waterNexts;queue> hedgehogNexts;int dx[4] = { -1, 0, 1, 0 };int dy[4] = { 0, -1, 0, 1 };int main() { ios::sync_with_stdio(false); cin.tie(0); int r, c; cin >> r >> c; world = ..

문제: 29634번: Hotel #include using namespace std;vector> board;vector> visits;int dx[4] = { -1, 0, 1, 0 };int dy[4] = { 0, -1, 0, 1 };int n, m; // 높이, 너비long long BFS(pair start) { long long size = 0; queue> nexts; nexts.push(start); visits[start.first][start.second] = true; while (!nexts.empty()) { pair cur = nexts.front(); nexts.pop(); size++; for (int i = 0; i n - 1 || ny m - 1) continue;..

문제: 1461번: 도서관 #include using namespace std;int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; // 책의 개수, 세준이가 드는 책의 개수 cin >> n >> m; if (n == 1) { int book; cin >> book; if (book > 0) { cout plusBooks; vector minusBooks; for (int i = 0; i > book; if (book > 0) { plusBooks.push_back(book); } else { minusBooks.push_back(book); } } sort(plusBooks.begin(), plusBooks.end()); s..

문제: 24446번: 알고리즘 수업 - 너비 우선 탐색 3 //#include #include #include #include #include #include #include using namespace std;int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m, r; // 정점의 수, 간선의 수, 시작 정점 cin >> n >> m >> r; // 0번 인덱스 안 써 vector> nodes = vector>(n + 1); vector dists = vector(n + 1, -1); vector visits = vector(n + 1, 0); for (int i = 0; i > u >> v; // 무방향 그래프 nodes[u].push_back(..