P3366 【模板】最小生成树(Prim or Kruskal)

【模板】最小生成树 - 洛谷https://www.luogu.com.cn/problem/P3366

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


//最小生成树
//Prim对密集图好用
//优先队列优化后
int head[MAXN];
int ver[MAXN];
int cost[MAXN];
int nxt[MAXN];
int cnt;
inline void add(int u, int v, int c) {
	ver[++cnt] = v;
	cost[cnt] = c;
	nxt[cnt] = head[u];
	head[u] = cnt;
}
int d[MAXN];
bool vis[MAXN];
int n, m;
int ans = 0;
typedef pair<int, int> P;

inline void Prim() {
	memset(d, 0x3f, sizeof(d));
	priority_queue<P, vector<P>, greater<P> > que;
	que.push(P(0, 1));
	//vis[1]=true;
	int nown = 0;
	while (!que.empty() && nown < n) {
		P t = que.top();
		que.pop();
		if (vis[t.second])
			continue;
		vis[t.second] = true;
		nown++;
		ans += t.first;
		for (int i = head[t.second]; i; i = nxt[i]) {
			int v = ver[i];
			int c = cost[i];
			if (!vis[v] && c < d[v]) {
				d[v] = c;
				que.push(P(c, v));
			}
		}
	}
	if (nown < n) {
		printf("orz");
		return;
	}
	printf("%d", ans);
}

int main() {
	int u, v, c;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d", &u, &v, &c);
		add(u, v, c);
		add(v, u, c);
	}
	Prim();
	//printf("%d", ans);
	return 0;
}

#if 0

//Kruskal对稀疏图好用
struct node {
	int u, v, val;
};

int n, m, fa[MAXN];

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

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

inline void unite(int u, int v) {
	u = find(u);
	v = find(v);
	fa[u] = v;
}

inline bool same(int u, int v) {
	return find(u) == find(v);
}

vector<node> edge;
bool cmp(node a, node b) {
	return a.val < b.val;
}

int main() {
	scanf("%d %d", &n, &m);
	init(n);
	node t;
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d", &t.u, &t.v, &t.val);
		edge.push_back(t);
	}
	sort(edge.begin(), edge.end(), cmp);
	int ans = 0;
	int now = n;
	for (int i = 0; i < m; i++) {
		if (!same(edge[i].u, edge[i].v)) {
			now--;
			ans += edge[i].val;
			unite(edge[i].u, edge[i].v);
		}
		if (now == 1) {
			printf("%d", ans);
			return 0;
		}
	}
	printf("orz");
	return 0;
}
#endif