list + 并查集

https://ac.nowcoder.com/acm/contest/5668/G

#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <cstring>

using namespace std;

int t, n, m;

const int maxn = 8e5 + 10;

vector <int> node[maxn];
int fa[maxn] = {0};
list <int> lists[maxn];
bool visit[maxn] = {0};

int find(int x)
{
	if(fa[x] != x) fa[x] = find(fa[x]);
	return fa[x];
}

void unite(int x, int y)
{
	int r1 = find(x);
	int r2 = find(y);
	if(r1 != r2)
	{
		fa[r1] = r2;
		lists[r2].splice(lists[r2].end(), lists[r1]);
	}
	
}

void search(int cur)
{
	if(find(cur) != cur) return;
	int size = lists[cur].size();
	
	for(int i = 0; i < size; i++)
	{
		int now = lists[cur].front();
		for(int j = 0; j < node[now].size(); j++)
		{
			int to = node[now][j];
			unite(to, cur);
			if(visit[to]) continue;
			lists[cur].push_back(to);
			visit[to] = true;
		}
		lists[cur].pop_front();
	}
	
}

int main()
{
	cin >> t;
	while(t--)
	{
		cin >> n >> m;
		for(int i = 0; i <= n + 5; i++)
		{
			fa[i] = i;
			node[i].clear();
			lists[i].clear();
			lists[i].push_back(i);
		}
		memset(visit, false, sizeof(bool) * (n + 5));
		for(int i = 1; i <= m; i++)
		{
			int x, y;
			cin >> x >> y;
			node[x].push_back(y);
			node[y].push_back(x);
		}
		
		int q;
		cin >> q;
		for(int i = 1; i <= q; i++)
		{
			int o;
			cin >> o;
			search(o);
		}
		
		for(int i = 0; i < n; i++)
		{
			cout << find(i) << " ";
		}
		cout << endl;
	}
	
	
	
	
	
	return 0;
}