HDU 5876 Sparse Graph(bfs+set)

$求一个图的补图里的最短路，一般点很多，边很少，很经典$
$bfs，一个集合存还没有走过的点，然后考虑当前点$
$如果v没有走过，并且和它在原题里有边，那么就放进另外个集合$
$然后前一个集合里剩下的dis=dis[u]+1$
$然后继续bfs即可$
$复杂度O(m+n)$

---

代码：

include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           200005
#define   MAXN          1000005
#define   maxnode       15
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-8;
const int    mod   = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

struct Edge{
    int v,next;
}edge[MAX];
int head[MAX];
int dis[MAX];
set<int> tmp[2];
int tot;

void init(){
    mem(head,-1);
    mem(dis,INF);
    tot=0;
}

void add_edge(int a,int b){
    edge[tot]=(Edge){b,head[a]};
    head[a]=tot++;
}

int main(){
    //freopen("in.out","r",stdin);
    int t;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        init();
        for(int i=0;i<m;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            add_edge(a,b);
            add_edge(b,a);
        }
        int s;
        cin>>s;
        queue<int> q;
        q.push(s);
        dis[s]=0;
        tmp[0].clear();tmp[1].clear();
        int cnt=0;
        for(int i=1;i<=n;i++){
            if(i!=s){
                tmp[cnt].insert(i);
            }
        }
        while(!q.empty()){
            int u=q.front();q.pop();
            for(int i=head[u];i!=-1;i=edge[i].next){
                int v=edge[i].v;
                if(tmp[cnt].count(v)){
                    tmp[cnt].erase(v);
                    tmp[cnt^1].insert(v);
                }
            }
            for(set<int>::iterator it=tmp[cnt].begin();it!=tmp[cnt].end();it++){
                int v=*it;
                if(dis[v]>dis[u]+1){
                    //cout<<v<<endl;
                    dis[v]=dis[u]+1;
                    q.push(v);
                }
            }
            tmp[cnt].clear();
            cnt^=1;
        }
        vector<int> ans;
        for(int i=1;i<=n;i++){
            if(i==s) continue;
            if(dis[i]==INF) ans.push_back(-1);
            else ans.push_back(dis[i]);
        }
        for(int i=0;i<ans.size();i++){
            printf("%d",ans[i]);
            if(i==ans.size()-1) printf("\n");
            else printf(" ");
        }
    }
    return 0;
}