HDU5876

补图最短路：

#include <bits/stdc++.h>

using namespace std;
#define SZ(X) ((int)X.size())
#define pb push_back
#define RALL(X) X.rbegin(),X.rend()
#define ALL(X) X.begin(),X.end()

#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1

using ll = long long ;
using ld = long double ;

const int INF = 0x3f3f3f3f;
const int N = 2E5 + 7;

set<int>T1,T2;
int dis[N];
vector<int>G[N];
void gao(int s)
{
    T1.erase(s);
    memset(dis, 0x3f, sizeof(dis));
    dis[s] = 0;
    queue<int> que;
    que.push(s);
    while(!que.empty()) {
        int top = que.front();
        que.pop();
        for(int i = 0;i < SZ(G[top]);i ++) {
            int v = G[top][i];
            if(!T1.count(v)) continue;
            T1.erase(v);
            T2.insert(v);
        }
        for(auto it : T1) {
            que.push(it);
            dis[it] = dis[top] + 1;
        }
        T1.swap(T2);
        T2.clear();
    }                           
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T --) {
        T1.clear();
        T2.clear();
        int n, m;
        scanf("%d%d",&n,&m);
        for(int i = 1;i <= n;i ++) G[i].clear();
        for(int i = 1;i <= n;i ++) T1.insert(i);
        while(m --) {
            int a, b;
            scanf("%d%d",&a,&b);
            G[a].pb(b);
            G[b].pb(a);
        }
        int s;
        scanf("%d",&s);
        gao(s);
        for(int i = 1;i <= n;i ++) {
            if(i == s) continue;
            if(dis[i] == INF) dis[i] = -1;
            printf("%d%c",dis[i],i==n?'\n':' ');
        }
    }
    return 0;
}