BZOJ1083 繁忙的都市

目录

• BZOJ1083 繁忙的都市
• 题解
• ｃｏｄｅ

BZOJ1083 繁忙的都市

题目传送门

题解

水题，裸的最小生成树

ｃｏｄｅ

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
/*================Header Template==============*/
const int maxn=1e5+500;
struct edge {
	int u,v,c;
	bool operator < (const edge &rhs) const {
		return c<rhs.c;
	}
}E[maxn];
int fa[maxn];
int n,m;
int ans=0;
/*==================Define Area================*/
void init() {
	for(int i=1;i<=n;i++) fa[i]=i;
}
int find(int x) {
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
void unite(int u,int v,int c) {
	u=find(u);v=find(v);
	if(u==v) return ;
	fa[u]=v;
	ans=max(ans,c);
	return ;
}

int main() {
	read(n);read(m);
	init();
	for(int i=1;i<=m;i++) {
		read(E[i].u);read(E[i].v);read(E[i].c);
	}
	printf("%d ",n-1);
	sort(E+1,E+1+m);
	for(int i=1;i<=m;i++) {
		unite(E[i].u,E[i].v,E[i].c);
	}
	printf("%d\n",ans);
	return 0;
}