2023河南萌新联赛第（二）场：河南工业大学 H 欢乐颂 最小生成树➕树的直径

#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'

using namespace std;

typedef pair<int, int> PII;
typedef long long ll;
typedef struct
{
	int a, b, w;
	ll num;
} Node;

const int N = 1000010;

Node edges[N];
int n, cnt;
vector<PII> edge[N];
int b[20], p[N];
int h[100010], e[N], w[N], ne[N], idx;
int dist[100010], pos;
bool st[N];

bool cmp(Node A, Node B)
{
	if(A.w == B.w)return A.num < B.num;
	return A.w < B.w;
}

inline void init()
{
	for(int i = 1; i <= n; i ++)p[i] = i;
}

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

inline void add(int a, int b, int c)
{
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}

void dfs(int u)
{
	st[u] = true;
	if(dist[u] > dist[pos])
	{
		pos = u;
	}
	
	for(int i = h[u]; i != -1; i = ne[i])
	{
		int j = e[i];
		if(st[j])continue;
		dist[j] = dist[u] + w[i];
		dfs(j);
	}
}

inline void solve()
{
	cin >> n;
	for(int i = 1; i <= n; i ++)
	{
		int k, sum = 0;
		cin >> k;
		for(int j = 0; j < k; j ++)
		{
			cin >> b[j];
			sum += b[j];
		}
		for(int j = 0; j < k; j ++)
		{
			int x = b[j];
			edge[x].push_back({i, sum});
		}
	}
	
	for(int i = 1; i <= 1000000; i ++)
	{
		for(int j = 0; j < edge[i].size(); j ++)
		{
			for(int k = j + 1; k < edge[i].size(); k ++)
			{
				edges[cnt] = {edge[i][j].first, edge[i][k].first, (edge[i][j].second ^ edge[i][k].second) + 1};
				edges[cnt ++].num = (ll)edge[i][j].first * n + edge[i][k].first;
			}
		}
	}
	
	sort(edges, edges + cnt, cmp);
	init();
	
	memset(h, -1, sizeof h);
    int count = 0;
	for(int i = 0; i < cnt; i ++)
	{
		int a = edges[i].a, b = edges[i].b, w = edges[i].w;
		int pa = find(a), pb = find(b);
		if(pa != pb)
		{
            count ++;
			p[pa] = pb;
			add(a, b, w), add(b, a, w);
		}
	}
    if(count != n - 1)
    {
        cout << 0 << endl;
        return;
    }
	
	dfs(1);//pos是最大的那个位置
    //cout << "===" << pos << endl;
	memset(dist, 0, sizeof dist); 
    memset(st, 0, sizeof st);
	dfs(pos);
    //cout << "===" << pos << endl;
	cout << dist[pos] << endl;
}

int main()
{
	IOS
	int _ = 1;
	while(_ --)
	{
		solve();
	}
	
	return 0;
}

树的直径：随意选一个点找到距离它点最远的点，然后再从这个点找到和它最远的点的距离就是树的直径。

最小生成树：从最小的边往大连。

模版+模版，难度仿佛飙升。

注意特判连不成最小生成树的时候输出0。