HDU 2121 Ice_cream’s world II(最小树形图+不定根)

思路：先制造一个虚拟结点：它向所有结点连一条边，权值要大于原图中所有权值的和，以它为根跑最小树形图，如果ans >= 2 * sum，那么说明从虚拟结点连出去两条以上的边，即原图不连通，反之原图必联通，且权值和为ans - sum。根节点就是树形图上虚拟节点的边指向的那个结点

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e3 + 5;
const int M = 2e4;
const long long Inf = 1e12;
long long d[N];
int ID[N], vis[N], pre[N], pos;
struct edge {
    int u, v;
    long long cost;
} es[M];
long long MST(int root, int V, int E) {
    long long res = 0;
    while(true) {
        for(int i = 0; i < V; i += 1) d[i] = Inf;
        for(int i = 0; i < E; i += 1) {
            int u = es[i].u;
            int v = es[i].v;
            if(d[v] > es[i].cost && u != v) {
                d[v] = es[i].cost;
                pre[v] = u;
                if(u == root) pos = i;
            }
        }
        for(int i = 0; i < V; i += 1) {
            if(i == root) continue;
            if(d[i] == Inf) return -1;
        }
        int c;
        d[root] = c = 0;
        memset(vis,-1,sizeof(vis));
        memset(ID,-1,sizeof(ID));
        for(int i = 0; i < V; i += 1) {
            int v = i;
            res += d[i];
            while(ID[v] == -1 && vis[v] != i && v != root) {
                vis[v] = i;
                v = pre[v];
            }
            if(ID[v] == -1 && v != root) {
                for(int u = pre[v]; u != v; u = pre[u]) ID[u] = c;
                ID[v] = c;
                c += 1;
            }
        }
        if(!c)
            break;
        for(int i = 0; i < V; i += 1) {
            if(ID[i] == -1) { ID[i] = c; c += 1; }
        }
        for(int i = 0; i < E; i += 1) {
            int u = es[i].u;
            int v = es[i].v;
            es[i].u = ID[u];
            es[i].v = ID[v];
            if(ID[u] != ID[v]) es[i].cost -= d[v];
        }
        V = c;
        root = ID[root];
    }
    return res;
}
int main() {
    int V, E, x, y;
    long long ci;
    while(~scanf("%d%d", &V, &E)) {
        long long all = 0;
        for(int i = 0; i < E; i += 1) {
            scanf("%d%d%lld", &x, &y, &ci);
            if(x == y) {
                --i;
                --E;
                continue;
            }
            es[i] = edge{x, y, ci};
            all += ci;
        }
        all += 1;
        for(int i = E; i < E + V; i += 1) es[i] = edge{V, i - E, all};
        long long res = MST(V, V + 1, V + E);
        if(res >= 2 * all)
            printf("impossible\n\n");
        else
            printf("%lld %d\n\n", res - all, pos - E);
    }
    return 0;
}