最小树形图

最小树形图

HDU 2121 题目连接

题意

有n个城市,m条有向路径，问是否能够从一个点出发通过所有点，并且总路径最小，如果有就输出总路径和开始点

思路

建立一个超级源点，超级源点到每个点的距离为所有边权的和再加上一
标记与超级源点相连的点就是起点

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1111;
const int M = 4e4 + 8;
const int INF = 0x3f3f3f3f;
struct node{
    int u,v,len;
}e[M];
int lowcost[N];
int id[N],vis[N],pre[N];
int index;
int Direct_mst(int root,int V,int E)
{
    int ans = 0;
    while(true){
        for (int i = 0; i < V; i++) lowcost[i] = INF;
        for (int i = 0; i < E; i++){
            int u = e[i].u;
            int v = e[i].v;
            if (lowcost[v] > e[i].len && u != v){
                lowcost[v] = e[i].len;
                pre[v] = u;
                if (u == root) index = i;
            }
        }
        for (int i = 0; i < V; i++){
            if (i != root && lowcost[i] == INF) return -1;
        }
        memset(vis,-1,sizeof(vis));
        memset(id,-1,sizeof(id));
        lowcost[root] = 0;
        int cnt = 0;
        for (int i = 0; i < V; i++){
            ans += lowcost[i];
            int v = i;
            while (vis[v] != i && v != root && id[v] == -1){
                vis[v] = i;
                v = pre[v];
            }
            if (v != root && id[v] == -1){
                for (int u = pre[v]; u != v; u = pre[u]){
                    id[u] = cnt;
                }
                id[v] = cnt++;
            }
        }
        if (cnt == 0) break;
        for (int i = 0; i < V; i++){
            if (id[i] == -1) id[i] = cnt++;
        }
        for (int i = 0; i < E; i++){
            int u = e[i].u;
            int v = e[i].v;
            e[i].u = id[u];
            e[i].v = id[v];
            if (id[u] != id[v]){
                e[i].len -= lowcost[v];
            }
        }
        root = id[root];
        V = cnt;
    }
    return ans;
}
int main()
{
    int n,m;
    while(scanf("%d %d",&n,&m) == 2){
        int sum = 1;
        for (int i = 0; i < m; i++){
            scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].len);
            sum += e[i].len;
        }
        for (int i = 0; i < n; i++){
            e[i + m].len = sum;
            e[i + m].u = n;
            e[i + m].v = i;
        }
        int ans = Direct_mst(n,n + 1,n + m) - sum;
        if (ans >= sum)  printf("impossible\n");
        else printf("%d %d\n",ans, index - m);
        printf("\n");
    }
    return 0;
}