HDU1233畅通工程
来源:互联网 发布:mac下制作windowsu盘 编辑:程序博客网 时间:2024/05/16 11:42
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
const int maxn = 105;
const int maxm = 50005;
struct Edge{
int v1, v2, weight;
Edge(int v1=0, int v2=0, int weight=0):v1(v1),v2(v2),weight(weight){}
};
int n, ans, cnt;
int parent[maxn];
int Rank[maxn];
Edge E[maxm];
void Init(){
ans = 0;
cnt = 0;
for(int i = 0; i <= n; i++){
parent[i] = i;
Rank[i] = 0;
}
}
bool cmp(const Edge& lhs, const Edge& rhs){
return lhs.weight < rhs.weight;
}
int findRoot(int x){
int tempRoot;
int root = x;
while(root != parent[root])
root = parent[root];
while(x != root){
tempRoot = parent[x];
parent[x] = root;
x = tempRoot;
}
return root;
}
void Union(int x, int y){
int xRoot = findRoot(x);
int yRoot = findRoot(y);
if(xRoot == yRoot)
return ;
if(Rank[xRoot] < Rank[yRoot])
parent[xRoot] = yRoot;
else if(Rank[xRoot] > Rank[yRoot])
parent[yRoot] = xRoot;
else {
parent[xRoot] = parent[yRoot];
Rank[yRoot] ++;
}
}
void Kruskal(){
int edgeNum = 0;
for(int i = 0; i < cnt&& edgeNum != n - 1; ++ i){
if(findRoot(E[i].v1) == findRoot(E[i].v2))
continue;
else {
Union(E[i].v1,E[i].v2);
ans += E[i].weight;
edgeNum++;
}
}
}
int main(){
int v1, v2, weight;
while(scanf("%d",&n)!=EOF&&n){
Init();
for(int i = 0; i < n*(n-1)/2; i++){
scanf("%d%d%d",&v1,&v2,&weight);
E[cnt++] = Edge(v1,v2,weight);
}
sort(E,E+cnt,cmp);
Kruskal();
printf("%d\n",ans);
}
return 0;
}
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
const int maxn = 105;
const int maxm = 50005;
struct Edge{
int v1, v2, weight;
Edge(int v1=0, int v2=0, int weight=0):v1(v1),v2(v2),weight(weight){}
};
int n, ans, cnt;
int parent[maxn];
int Rank[maxn];
Edge E[maxm];
void Init(){
ans = 0;
cnt = 0;
for(int i = 0; i <= n; i++){
parent[i] = i;
Rank[i] = 0;
}
}
bool cmp(const Edge& lhs, const Edge& rhs){
return lhs.weight < rhs.weight;
}
int findRoot(int x){
int tempRoot;
int root = x;
while(root != parent[root])
root = parent[root];
while(x != root){
tempRoot = parent[x];
parent[x] = root;
x = tempRoot;
}
return root;
}
void Union(int x, int y){
int xRoot = findRoot(x);
int yRoot = findRoot(y);
if(xRoot == yRoot)
return ;
if(Rank[xRoot] < Rank[yRoot])
parent[xRoot] = yRoot;
else if(Rank[xRoot] > Rank[yRoot])
parent[yRoot] = xRoot;
else {
parent[xRoot] = parent[yRoot];
Rank[yRoot] ++;
}
}
void Kruskal(){
int edgeNum = 0;
for(int i = 0; i < cnt&& edgeNum != n - 1; ++ i){
if(findRoot(E[i].v1) == findRoot(E[i].v2))
continue;
else {
Union(E[i].v1,E[i].v2);
ans += E[i].weight;
edgeNum++;
}
}
}
int main(){
int v1, v2, weight;
while(scanf("%d",&n)!=EOF&&n){
Init();
for(int i = 0; i < n*(n-1)/2; i++){
scanf("%d%d%d",&v1,&v2,&weight);
E[cnt++] = Edge(v1,v2,weight);
}
sort(E,E+cnt,cmp);
Kruskal();
printf("%d\n",ans);
}
return 0;
}
0 0
- HDU1233畅通工程
- 还是畅通工程 hdu1233
- hdu1233还是畅通工程
- hdu1233还是畅通工程
- HDu1233 还是畅通工程
- hdu1233还是畅通工程
- 还是畅通工程hdu1233
- HDU1233还是畅通工程
- hdu1233还是畅通工程
- hdu1233-还是畅通工程
- hdu1233 还是畅通工程
- 还是畅通工程 hdu1233
- HDU1233还是畅通工程
- HDU1233还是畅通工程
- hdu1233还是畅通工程
- HDU1233:还是畅通工程
- HDU1233还是畅通工程
- hdu1233还是畅通工程
- [2015-08-09] python020
- ubuntu下中文输入法的安装--fcitx
- hdu 4280 Island Transport (最大流)
- leetCode #231 Power of Two
- 送给自己的一篇文章
- HDU1233畅通工程
- skynet项目lua代码简单加密
- java中的代码块理解
- hive从查询中获取数据插入到表或动态分区
- js语法基础1
- 红黑树的插入与删除
- 友商害我差点开除一个工程师
- 安装fcitx五笔拼音
- 【面试题】之数据结构目录