J - Welcome Party ZOJ - 4109 并查集 bfs

J - Welcome Party

 ZOJ - 4109 

此处是题面...

 

思路：并查集分块，然后把每一块编号最小的那个人存在优先队列里，每次把此刻能进入门的人压进优先队列，按取出次序就是答案。

注意：并查集par数组一定用par[i] = i初始化，否则不是爆栈就是T，别问我怎么知道的，md调了半天...

AC代码

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define sdddd(x,y,z,k) scanf("%d%d%d%d", &x, &y, &z, &k)
#define sddd(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define sdd(x,y) scanf("%d%d", &x, &y)
#define sd(x) scanf("%d", &x)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
//#define mp make_pair
#define pb push_back
#define ms(x, y) memset(x, y, sizeof x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
const int maxn = 1000000 + 50;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
//typedef vector<ll> vec;
//typedef vector<vec> mat;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}

int n, m, t;
int len, le;
int ans[maxn];
int vis[maxn];
int par[maxn];
struct Edge{
    int to;
    int next;
};
Edge G[maxn*4];
int h[maxn];
priority_queue<int, vector<int>, greater<int> > pque;
void add_edge(int from, int to){
    G[le].to = to;
    G[le].next = h[from];
    h[from] = le++;

    G[le].to = from;
    G[le].next = h[to];
    h[to] = le++;
}

int Find(int x) {
    int r = x;
    while (par[r] != r)
        r = par[r];
    int i = x, j;
    while (i != r) {
        j = par[i];
        par[i] = r;
        i = j;
    }
    return r;
}
void Unit(int x, int y){
    int fx = Find(x);
    int fy = Find(y);
    if(fx > fy){
        par[fx] = fy;
    }
    else
        par[fy] = fx;
}
int main()
{
    scan_d(t);
    while(t--){
        len = 0, le = 0;
        int ta, tb, cnt = 0;
        scan_d(n);scan_d(m);
        rep(i, 0, n+1){
            vis[i] = 0;
            h[i] = -1;
            par[i] = i;
        }
        rep(i, 1, m){
            scan_d(ta);scan_d(tb);
            add_edge(ta, tb);
            Unit(ta, tb);
        }

        rep(i, 1, n){
            if(par[i] == i)
            {
                cnt++;
                pque.push(i);
                vis[i] = 1;
            }
        }
        while(pque.size()){
            int nn = pque.top(); pque.pop();
            ans[len++] = nn;
            for(int i = h[nn]; i != -1; i = G[i].next){
                int e = G[i].to;
                if(!vis[e]){
                    vis[e] = 1;
                    pque.push(e);
                }
            }
        }
        printf("%d\n", cnt);
        rep(i, 0, len-1){
            if(i)
                putchar(' ');
            printf("%d", ans[i]);
        }
        putchar('\n');
    }
	return 0;
}