2016 ACM/ICPC Asia Regional Dalian Online
Hdu 5876 SparseGraph
题意:给定一个N个顶点,M条边的无向图G,求其补图H中给定的源点S到其他N-1个点的最短距离,每条边的长度为单位长度1。
分析:明显的最短路,但是注意是求其补图的最短路,注意到每条边的长度为1,那么可以直接使用队列BFS求得S点到每个点的最短路就行了,这算是bfs的一个经典应用了。首先加入S,然后不断地加入邻接的点,更新还未求出最短路的点就行了。
代码:
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#define INF 0x3f3f3f3f
#define LL long long
using namespace std;
struct queue{
int fro, rea;
int a[5000000];
}q;
int vis[200010], d[200010], s, t, n, m, v[200010];
vector<int> G[200010];
void solve()
{
q.fro = q.rea = 0;
int sum = 1;
memset(vis, 0, sizeof(vis));
memset(d, 0, sizeof(d));
q.a[q.rea++] = s;
vis[s] = 1;
while (q.fro < q.rea && sum != n){
int t = q.a[q.fro++];
int l = G[t].size();
memset(v, 0, sizeof(v));
v[t] = 1;
for (int i = 0; i < l; i++){
v[G[t][i]] = 1;
}
for (int i = 1; i <= n; i++){
if (!vis[i] && !v[i]){
d[i] = d[t]+1; vis[i] = 1;
sum++;
q.a[q.rea++] = i;
}
}
}
}
int main()
{
scanf("%d", &t);
while (t--){
scanf("%d %d", &n, &m);
for (int i = 1; i < n; i++) G[i].clear();
for (int i = 0; i < m; i++){
int f, t;
scanf("%d %d", &f, &t);
G[f].push_back(t);
G[t].push_back(f);
}
scanf("%d", &s);
solve();
int cnt = 1;
for (int i = 1; i <= n; i++){
if (i != s){
if (cnt++ != 1) printf (" ");
if (!d[i]) printf("-1");
else printf("%d", d[i]);
}
}
puts ("");
}
return 0;
}