Dijkstra: Shortest Reach 2
简单BFS题。。。1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1100;
vector<int> adj[maxn];
bool vis[maxn];
int dis[maxn];
int main() {
int test, n, m, s;
scanf("%d", &test);
for (int cas = 1; cas <= test; cas++) {
scanf("%d %d", &n, &m);
memset(vis, false, sizeof(vis));
memset(dis, -1, sizeof(dis));
for (int i = 0; i < maxn; i++)
adj[i].clear();
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
adj[x].push_back(y);
adj[y].push_back(x);
}
scanf("%d", &s);
queue<int> q;
q.push(s);
vis[s] = true;
dis[s] = 0;
while (!q.empty()) {
int u = q.front();
// puts("fuck");
q.pop();
vis[u] = true;
for (int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if (!vis[v]) {
q.push(v);
vis[v] = true;
dis[v] = dis[u] + 6;
}
}
}
for (int i = 1; i <= n; i++) {
if (i != s)
printf("%d ", dis[i]);
}
puts("");
}
}