OJ Board

Code: Select all

4
6
1 2 10
1 3 10
1 4 10
2 3 10
2 4 10
3 4 10
0

Code: Select all

60

Code: Select all

#include<iostream.h>
#include<stdlib.h>
#include<string.h>

#define MAXN 50

int P[MAXN], Rank[MAXN], Check[MAXN];

int Node, edg, Cost, f;

struct edge 
{
	int u, v;
	int cost;
};

edge Edge[MAXN*MAXN];
edge Path[MAXN];

int com(const void *xy, const void *xz) 
{
	edge *x = (edge*)xy;
	edge *y = (edge*)xz;
	return (x->cost - y->cost);
}

void In() 
{ // initializing parent and rank for each node
	int i;
	for(i = 1; i<= Node; i++) 
	{
		P[i] = i;			
		Rank[i] = 1;
	}
}

int Find(int n) 
{ // find the parent of a node
	if(P[n] != n) 
		P[n] = Find(P[n]);
	return P[n];
}

void Link(int x, int y) 
{ // joining the nodes
	if(Rank[x] > Rank[y]) 
	{
		P[y] = x;
	}
	else 
	{
		P[x] = y;
		if(Rank[x] == Rank[y])
			Rank[y]++;
	}
}


void Kruscal() 
{
	int x, y,total = 0;
	Cost = f = 0;
	for(int i = 0; i<edg; i++) 
	{
		x = Find(Edge[i].u);
		y = Find(Edge[i].v);
		if(x != y && Check[i]==0) 
		{ // if not cycle

			Check[i] = 1;
			Path[total++] = Edge[i]; 
			Link(x,y); // join those node
			Cost += Edge[i].cost;
			if(total == Node - 1) 
			{
				f=1;
				break;
			}
		}
	}
}


void Cal() 
{
	long C;
	qsort(Edge,edg,sizeof(edge),com); // sorting the edges respect to cost
	Kruscal();
	C=Cost;
	if(f)
	{
		In();
		Kruscal();
		C+=Cost;
	}
	if(f)
		cout<<C<<endl;
	else
		cout<<"No way!\n";

}



int main()
{
	int i;
	while(cin>>Node) 
	{ // reading number of node and edge
		if(!Node)
			break;
		cin>>edg;
		In();
		memset(Check,0,sizeof(Check));
		for(i = 0; i<edg; i++)  // reading each edate with cost
			cin>>Edge[i].u>>Edge[i].v>>Edge[i].cost;
		Cal();
	}
	return 0;
}

Code: Select all

4
7
1 2 1
1 2 1
2 3 1
2 4 10
2 4 20
3 4 1
3 4 100
0

Code: Select all

34