POJ3164 Command Network(最小树形图)

最新推荐文章于 2022-11-09 17:00:22 发布

weixin_30758821

最新推荐文章于 2022-11-09 17:00:22 发布

阅读量115

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/songorz/p/11516891.html

版权

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

Sample Output

31.19
poor snoopy

题解：zhuliu算法板题，只要改成double就行了。
参考代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
const int maxn=10010;

struct Node{
    double x,y;
} node[maxn];
struct Edge{
    int x,y;
    double w;
} edge[maxn];

int vis[maxn],id[maxn],pre[maxn];
double in[maxn];
double zhuliu(int root,int n,int m)
{
    double res=0;
    while(true)
    {
        for(int i=0;i<n;++i) in[i]=INF;
    
        for(int i=0;i<m;++i)
        {
            int x=edge[i].x,y=edge[i].y;
            if(edge[i].w<in[y] && x!=y)
            {
                pre[y]=x;
                in[y]=edge[i].w;
            }
        }
        
        for(int i=0;i<n;++i)
        {
            if(i==root) continue;
            if(in[i]==INF) return -1;    
        }
        
        int cnt=0;in[root]=0;
        memset(id,-1,sizeof id);
        memset(vis,-1,sizeof vis);
        for(int i=0;i<n;++i)
        {
            res+=in[i];
            int y=i;
            while(vis[y]!=i&&id[y]==-1&&y!=root)
            {
                vis[y]=i;
                y=pre[y];
            }
            if(y!=root&&id[y]==-1)
            {
                for(int x=pre[y];x!=y;x=pre[x])
                    id[x]=cnt;
                id[y]=cnt++;    
            }
        }
        
        if(cnt==0) break;
        for(int i=0;i<n;++i){if(id[i]==-1) id[i]=cnt++;}
        for(int i=0;i<m;++i)
        {
            int x=edge[i].x,y=edge[i].y;
            edge[i].x=id[x];
            edge[i].y=id[y];
            if(id[x]!=id[y]) edge[i].w-=in[y];    
        }
        n=cnt; root=id[root];    
    }    
    return res;
}

double calc(Node a,Node b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

int n,m;
int main()
{
    while(~scanf("%d%d",&n,&m) && (n+m))
    {
        for(int i=0;i<n;++i)
            scanf("%lf%lf",&node[i].x,&node[i].y);
        for(int i=0;i<m;++i)
        {
            scanf("%d%d",&edge[i].x,&edge[i].y);
            edge[i].x--;edge[i].y--;
            if(edge[i].x!=edge[i].y)
                edge[i].w=calc(node[edge[i].x],node[edge[i].y]);
            else edge[i].w=INF;      
        }
        double res=zhuliu(0,n,m);
        if(res==-1) puts("poor snoopy");
        else printf("%.2f\n",res);
    }
    
    return 0;    
}