继续畅通工程
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12963 Accepted Submission(s): 5602
当N为0时输入结束。
3 1 2 1 0 1 3 2 0 2 3 4 0 3 1 2 1 0 1 3 2 0 2 3 4 1 3 1 2 1 0 1 3 2 1 2 3 4 1 0
3 1 0
和constructing roads基本一样
先将已合并的合并,再将边按照权值排序,最后再次合并并计算结果
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int tree[100];
struct Edge{
int x;
int y;
int cost;
int state;
}edge[5000];
int findx(int x){
if(x!=tree[x]){
tree[x]=findx(tree[x]);
}
return tree[x];
}
bool merge(int x,int y){
int fx=findx(x);
int fy=findx(y);
if(fx!=fy){
tree[fy]=fx;
//原来没有连接,加权值
return true;
}else{
return false;
}
}
void init(){
for(int i=1;i<100;i++){
tree[i]=i;
}
memset(edge,0,sizeof(edge));
}
bool cmp(Edge a,Edge b){
return a.cost<b.cost;
}
int main(){
freopen("in.txt","r",stdin);
int zu;
while(scanf("%d",&zu)!=EOF && zu!=0){
init();
int bian=zu*(zu-1)/2;
for(int i=1;i<=bian;i++){
scanf("%d%d%d%d",&edge[i].x,&edge[i].y,&edge[i].cost,&edge[i].state);
}
//先将题目中连接在一起的合并
for(int i=1;i<=bian;i++){
if(edge[i].state==1){
merge(edge[i].x,edge[i].y);
}
}
//再将边按照权值排序
sort(edge+1,edge+1+bian,cmp);
//最后对于没有合并的进行合并,并计算
int ans=0;
for(int i=1;i<=bian;i++){
if(merge(edge[i].x,edge[i].y)){
ans+=edge[i].cost;
}
}
printf("%d\n",ans);
}
return 0;
}