민듀의 일상

https://www.acmicpc.net/problem/14502 #include #include #include using namespace std;struct Node { int y, x;};int N, M;int arr[9][9];int visited[9][9];int used[9][9];int result = 0;vector emptySpace;vector virus;int direct[4][2] = { -1, 0, 1, 0, 0, -1, 0, 1,};void bfs() { for (int i = 0; i q; for (int i = 0; i = N || dx = M) continue; if (visited[dy][dx]) continue; if (arr[dy][dx] != 0) con..

https://www.acmicpc.net/problem/11724 #include #include #include using namespace std;int N, M;int cnt = 0;int visited[1001];vector> v;void bfs(int start) { queue q; q.push(start); visited[start] = 1; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i > N >> M; v.resize(N + 1); for (int i = 0; i > from >> to; v[from].push_back(to); v[to].push_back(from); } for (int i = 1; i

https://www.acmicpc.net/problem/1697 #include #include using namespace std;int N, K;int visited[100001];void bfs() { queue q; q.push(N); visited[N] = 1; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i 100000) continue; if (visited[next] > N >> K; bfs(); cout

https://www.acmicpc.net/problem/1012 #include #include using namespace std;struct Node { int y, x;};int T, N, M, K;int cnt = 0;int arr[51][51];int visited[51][51];int direct[4][2] = { -1, 0, 1, 0, 0, 1, 0, -1,};void init();void bfs(Node start) { queue q; q.push(start); visited[start.y][start.x] = 1; while (!q.empty()) { Node now = q.front(); q.pop(); for (int i = 0; i = N || dx = M) continue;..

https://www.acmicpc.net/problem/2667 #include #include #include #include using namespace std;struct Node { int y, x;};int N;int arr[26][26];int visited[26][26];int direct[4][2] = { -1, 0, 1, 0, 0, 1, 0, -1,};vector result;void bfs(Node start) { queue q; visited[start.y][start.x] = 1; q.push(start); int cnt = 1; while (!q.empty()) { Node now = q.front(); q.pop(); for (int i = 0; i = N || dx = ..

https://www.acmicpc.net/problem/2178* 입력이 공백 없이 붙어서 나오는 경우임.#include #include using namespace std;struct Node { int y, x;};int N, M;int arr[101][101];int visited[101][101];int direct[4][2] = { -1, 0, 1, 0, 0, -1, 0, 1,};void bfs() { queue q; q.push({ 0, 0 }); visited[0][0] = 1; while (!q.empty()) { Node now = q.front(); q.pop(); for (int i = 0; i = N || dx = M) continue; if (arr[dy][dx] == ..

https://www.acmicpc.net/problem/7576#include #include using namespace std;struct Node { int y; int x;};int N, M;int arr[1001][1001];int visited[1001][1001];int direct[4][2] = { -1, 0, 1, 0, 0, 1, 0, -1,};queue q;void bfs() { while (!q.empty()) { Node now = q.front(); q.pop(); for (int i = 0; i = N || dx = M) continue; if (arr[dy][dx] != 0) continue; if (visited[dy][dx] > 0) continue; vi..

https://www.acmicpc.net/problem/2606#include #include using namespace std;int N, M;int cnt = 0;vector> v;int visited[101];void dfs(int now) { cnt++; for (int i = 0; i > N >> M; v.resize(N + 1); for (int i = 0; i > a >> b; v[a].push_back(b); v[b].push_back(a); } visited[1] = 1; dfs(1); cout

https://www.acmicpc.net/problem/1260 #include #include #include #include using namespace std;int N, M, start;vector> v;int used[1001];int printed[1001];void dfs(int now) { cout q; used[start] = 1; q.push(start); while (!q.empty()) { int now = q.front(); q.pop(); cout > N >> M >> start; v.resize(N + 1); for (int i = 0; i > a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 0; i