본문 바로가기

백준 알고리즘/BFS47

백준 2644번 C++ #include #include #include #include using namespace std; int peoplenum, firstpeople, secondpeople, linknum;vector v;int countans[100];int num,maxnum=987654321; void bfs(void) {queue q;q.push(firstpeople); while (!q.empty()) {int people = q.front();q.pop(); if (people == secondpeople) {cout peoplenum;cin >> firstpeople >> secondpeople;cin >> linknum; memset(countans, 0, sizeof(countans));for (int.. 2019. 1. 12.
백준 14502번 C++ #include #include #include using namespace std; const int MAX = 8; int lab[MAX][MAX];int labcopy[MAX][MAX];int m, n;vector emptyroom; typedef struct {int x, y;}Move;Move mv[4] = { {-1,0},{1,0},{0,1},{0,-1} }; void dfs(int i, int j) { for (int k = 0; k = 0 && ma = 0 && mb < m) {if (labcopy[ma][mb] == 0) {labcopy[ma][mb] = 2;.. 2019. 1. 10.
백준 2468번 C++ #include #include using namespace std; int area[100][100];int area2[100][100];int n;int visited[100][100]; typedef struct {int x, y;}Move;Move m[4] = { {1,0},{-1,0},{0,1},{0,-1} }; void arrcompute(int k) {for (int i = 0; i = 0 && mb < n) {if (visited[ma][mb] == 0 && area2[ma][mb] == 1)dfs(ma, mb);}}} int main(void) {cin .. 2019. 1. 9.
백준 11724번 C++ #include #include #include #include using namespace std; int n, m;vector way;int visited[1000]; void dfs(int i) {visited[i] = 1; for (int k = 0; k > n >> m; memset(visited, 0, sizeof(visited));for (int i = 0; i > x >> y;way.push_back(make_pair(x, y));wa.. 2019. 1. 9.

티스토리툴바