poj--3164--Command Network（最小生成图模板）



Command Network

Time Limit: 1000MS

Memory Limit: 131072KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of littleken’s command network. A provisional network must be built immediately. littleken orders snoopy to take charge of the project.

With the situation studied to every detail, snoopy believes that the most urgent point is to enable littenken’s commands to reach every disconnected node in the destroyed network and decides on a plan to build a unidirectional communication network. The nodes are distributed on a plane. If littleken’s commands are to be able to be delivered directly from a node A to another node B, a wire will have to be built along the straight line segment connecting the two nodes. Since it’s in wartime, not between all pairs of nodes can wires be built. snoopy wants the plan to require the shortest total length of wires so that the construction can be done very soon.

Input

The input contains several test cases. Each test case starts with a line containing two integer N (N ≤ 100), the number of nodes in the destroyed network, and M (M ≤ 10⁴), the number of pairs of nodes between which a wire can be built. The next N lines each contain an ordered pair x_i and y_i, giving the Cartesian coordinates of the nodes. Then follow M lines each containing two integers i and j between 1 and N (inclusive) meaning a wire can be built between node i and node j for unidirectional command delivery from the former to the latter. littleken’s headquarter is always located at node 1. Process to end of file.

Output

For each test case, output exactly one line containing the shortest total length of wires to two digits past the decimal point. In the cases that such a network does not exist, just output ‘poor snoopy’.

Sample Input

4 6
0 6
4 6
0 0
7 20
1 2
1 3
2 3
3 4
3 1
3 2
4 3
0 0
1 0
0 1
1 2
1 3
4 1
2 3

Sample Output

31.19
poor snoopy

Source

POJ Monthly--2006.12.31, galaxy

题意：求解以1为根的最小树形图的边权之和

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAXN 110
#define MAXM 100000
#define INF 0x3f3f3f3f
struct node
{
	int from,to;
	double cost;
}edge[MAXM];
struct P
{
	double x,y;
}p[MAXN];
int n,m,cnt;
int pre[MAXN],vis[MAXN],id[MAXN];
double in[MAXN];
double dis(P a,P b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
void add(int a,int b,double w)
{
	node E={a,b,w};
	edge[cnt++]=E;
}
void getmap()
{
	for(int i=0;i<n;i++)
		scanf("%lf%lf",&p[i].x,&p[i].y);
	int x,y;
	for(int i=0;i<m;i++)
	{
		scanf("%d%d",&x,&y);
		x--,y--;
		edge[i].from=x;
		edge[i].to=y;
		edge[i].cost=x==y?INF:dis(p[x],p[y]);
	}
}
double zhuliu(int root,int n,int m)
{
	double res=0;
	int u,v;
	while(true)
	{
		for(int i=0;i<n;i++)
		in[i]=INF;
		for(int i=0;i<m;i++)
		{
			node E=edge[i];
			if(E.from!=E.to&&E.cost<in[E.to])
			{
				pre[E.to]=E.from;
				in[E.to]=E.cost;//寻找最小入边集 
			}
		}
		for(int i=0;i<n;i++)
			if(i!=root&&in[i]==INF)
			return -1;//如果存在孤立点 
		int tn=0;//记录这次发现的环数 
		memset(id,-1,sizeof(id));
		memset(vis,-1,sizeof(vis));
		in[root]=0;
		for(int i=0;i<n;i++)
		{
			res+=in[i];
			v=i;
			while(vis[v]!=i&&id[v]==-1&&v!=root)
			{
				vis[v]=i;
				v=pre[v];
			}
			if(v!=root&&id[v]==-1)//发现新的环 
			{
				for(int u=pre[v];u!=v;u=pre[u])
				id[u]=tn;//记录发现的环对应的点 
				id[v]=tn++;
			}
		}
		if(tn==0) break;
		for(int i=0;i<n;i++)
			if(id[i]==-1)
			id[i]=tn++;
		for(int i=0;i<m;)//缩点 
		{
			v=edge[i].to;
			edge[i].from=id[edge[i].from];
			edge[i].to=id[edge[i].to];
			if(edge[i].from!=edge[i].to)
				edge[i++].cost-=in[v];//更新权值 
			 else
                swap(edge[i],edge[--m]);
		}
		n=tn;//建立新图之后的点数 
		root=id[root];//根节点对应的id 
	}
	return res;
}
int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		cnt=0;
		getmap();
		double ans=zhuliu(0,n,m);
		if(ans==-1)
			printf("poor snoopy\n");
		else
			printf("%.2lf\n",ans);
	}
	return 0;
}