【最小生成树】繁忙都市

链接

YbtOJ 繁忙都市
luogu P2230

题目描述

给出一个图，要求一个边的集合使得所有点都被包括，并且最大边权最小，现在要求出这个边集合的边数以及最大边权

样例输入

4 5
1 2 3
1 4 5
2 4 7
2 3 6
3 4 8

样例输出

3 6

思路

很裸的最小生成树
那就直接Kruskal和Prim都来一遍咯

代码

Kruskal

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>

using namespace std;

int t, n, m, ans, maxn;
int fa[1000005];

struct node
{
	int now, to, val;
}w[10000005];

void add(int x, int y, int z)
{
	w[++t] = (node){x, y, z};
	w[++t] = (node){y, x, z};
}

int find(int x)
{
	return (fa[x] == x)?(fa[x]):(fa[x] = find(fa[x]));
}

bool cmp(node x, node y)
{
	return x.val < y.val;
}

void kruskal()
{
	for(int i = 1; i <= n; ++i) fa[i] = i;
	for(int i = 1; i <= t; ++i)
	{
		int x = find(w[i].now), y = find(w[i].to);
		if(x != y)
		{
			fa[x] = y;
			ans++;
			maxn = max(maxn, w[i].val);
			if(ans == n - 1) printf("%d %d", ans, maxn);	
		} 	
	} 
} 

int main()
{
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; ++i)
	{
		int u, v, c;
		scanf("%d%d%d", &u, &v, &c);
		add(u, v, c);
	}
	sort(w + 1, w + t + 1, cmp);
	kruskal();
	return 0;
}

Prim

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define ll long long

using namespace std;

int t, n, m, maxn = -1;
ll minx;
int h[1000005], vis[1000005], dis[1000005];

struct node
{
	int to, next, val;
}g[1000005];

void add(int x, int y, int z)
{
	g[++t] = (node){y, h[x], z}; h[x] = t;
	g[++t] = (node){x, h[y], z}; h[y] = t;
}

int main()
{
	memset(dis, 0x7f, sizeof(dis));
	ll maxx = dis[0] + 1;
	queue<int>Q;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; ++i) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		add(x, y ,z);
	}
	vis[1] = 1;
	dis[1] = 0;
	for(int i = h[1]; i; i = g[i].next)
	{
		int to = g[i].to;
		dis[to] = g[i].val;
	}
	Q.push(1);
	while(Q.size())
	{
		bool b = 0;
		int k = 0;
		minx = maxx;
		int tot = Q.front();
		Q.pop();
		for(int i = 1; i <= n; i++)
		{
			if(!vis[i] && (dis[i] < minx))
			{
				b = 1;
				minx = dis[i];
				k = i;
			}
		}
		if(b) {
			vis[k] = 1;
			Q.push(k);
			for(int i = h[k]; i; i = g[i].next)
			{
				int to = g[i].to;
				if(!vis[to] && (dis[to] > g[i].val))
					dis[to] = g[i].val;
			}
		}
	}
	for(int i = 1; i <= n; ++i)
		if(dis[i] != dis[0]) maxn = max(maxn, dis[i]);
	printf("%d %d", n - 1, maxn);
}