목록그래프 (37)
정화 코딩
[C++] 구슬 탈출 2 (백준 13460번)
https://www.acmicpc.net/problem/13460 #include #include #include using namespace std;int dx[] = {1, -1, 0, 0};int dy[] = {0, 0, 1, -1};int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector> g(n, vector(m)); int ri, rj, bi, bj; for (int i = 0; i > s; for (int j = 0; j > q; vector>>> visited(n, vector>>(m, vector>(n, v..
[C++] 파티 (백준 1238번)
https://www.acmicpc.net/problem/1238 #include #include using namespace std;int n, m, x;vector> g;int MAX = 1000000000;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> x; g = vector>(n + 1, vector(n + 1, MAX)); for (int i = 0; i > a >> b >> t; g[a][b] = t; } for (int k = 1; k 처음에는 다익스트라로 하려고 했는데, 어차피 사람당 갔다 왔다 이렇게 2번 해야 해서 총 2*n번..
[C++] 뱀과 사다리 게임 (백준 16928번)
https://www.acmicpc.net/problem/16928 #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int move[111]; for (int i = 0; i > n >> m; for (int i = 0; i > a >> b; move[a] = b; } bool vst[111] = {}; vst[0] = true; queue> q; // q.emplace(1, 0); vst[1] = true; while (1) { int pos = q.front().fi..
[C++] DSLR (백준 9019번)
https://www.acmicpc.net/problem/9019 #include #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int start, end; cin >> start >> end; vector vst(10000, false); queue> q; q.emplace(start, ""); vst[start] = true; while (!q.empty()) { in..
[C++] 돌다리 (백준 12761번)
https://www.acmicpc.net/problem/12761 #include #include #include using namespace std;bool vst[1000001];int dir[] = {-1, 1, 0, 0, 0, 0};int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int a, b, n, m; cin >> a >> b >> n >> m; dir[2] = a; dir[3] = a * (-1); dir[4] = b; dir[5] = b * (-1); queue> q; q.emplace(n, 0); vst[n] = true; while (!q.e..
[C++] 치즈 (백준 2638번)
https://www.acmicpc.net/problem/2638 #include #include #include using namespace std;int dx[] = {1, -1, 0, 0};int dy[] = {0, 0, 1, -1};int n, m;vector> g;bool bfs() { vector> vst(n, vector(m, false)); vector> out(n, vector(m, false)); bool finish = true; queue> q; q.emplace(0, 0); vst[0][0] = true; while (!q.empty()) { int curi = q.front().first; int curj = q.fr..
[C++] 숨바꼭질 (백준 1697번)
https://www.acmicpc.net/problem/1697 #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int maxs = 100001; vector vst = vector(maxs, false); int cnt = 0; bool fin = false; queue q; q.push(n); vst[n] = true; while(!q.empty()) { int tmp = q.size(); for (int i = 0; i = 0 &..
[C++] 쉬운 최단거리 (백준 14940번)
https://www.acmicpc.net/problem/14940 #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int diri[] = {1, -1, 0, 0}; int dirj[] = {0, 0, 1, -1}; int n, m; cin >> n >> m; vector> g = vector>(n, vector(m)); vector> d = vector>(n, vector(m, 0)); int sa, sb; for (int i = 0; i > g[i][j]; if (g[i][j] == 2) { ..