poj3164Command Network

链接：http://poj.org/problem?id=3164

题意：给定n个点和m条有向边，求以1为根的生成树。

分析：最小树形图，朱刘算法裸题。O(n^3)。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=105;
const int mod=998244353;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
db ans,x[N],y[N],ma[N][N];
int n,q[N],p[N],pre[N];
db DI(int a,int b) {
    return sqrt((x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b]));
}
db Directed_MST(int root) {
    int i,j,k;db ret=0;
    memset(q,0,sizeof(q));
    while (1) {
        for (i=1;i<=n;i++)
        if (!q[i]&&i!=root) {
            pre[i]=i;ma[i][i]=inf;
            for (j=1;j<=n;j++)
            if (!q[j]&&ma[j][i]<ma[pre[i]][i]) pre[i]=j;
        }
        for (i=1;i<=n;i++)
        if (i!=root&&pre[i]==i) return -1;
        for (i=1;i<=n;i++)
        if (!q[i]&&i!=root) {
            memset(p,0,sizeof(p));
            for (j=i;!p[j]&&j!=root;p[j]=1,j=pre[j]);
            if (j!=1) break ;
        }
        if (i>n) {
            for (j=1;j<=n;j++)
            if (!q[j]&&j!=root) ret+=ma[pre[j]][j];
            break ;
        }
        i=j;ret+=ma[pre[i]][i];
        for (j=pre[j];j!=i;j=pre[j]) ret+=ma[pre[j]][j],q[j]=1;
        do {
            for (k=1;k<=n;k++)
            if (!q[k]) {
                ma[i][k]=min(ma[i][k],ma[j][k]);
                if (ma[k][j]!=inf) ma[k][i]=min(ma[k][i],ma[k][j]-ma[pre[j]][j]);
            }
            j=pre[j];
        } while (j!=i);
    }
    return ret;
}
int main()
{
    int a,b,i,j,m;
    while (scanf("%d%d", &n, &m)!=EOF) {
        for (i=1;i<=n;i++) scanf("%lf%lf", &x[i], &y[i]);
        for (i=1;i<=n;i++)
            for (j=1;j<=n;j++) ma[i][j]=inf;
        for (i=1;i<=m;i++) scanf("%d%d", &a, &b),ma[a][b]=DI(a,b);
        ans=Directed_MST(1);
        if (fabs(ans+1)<eps) printf("poor snoopy\n");
        else printf("%.2f\n", ans);
    }
    return 0;
}