[HDU]2121 Ice_cream’s world II 朱刘算法(不固定根)

　　就是不固定根的朱刘算法. 建一个虚点向每个点， 权值为sum+1， 若跑出来的结果>2 * sum显然图不连通. 否则-sum即为答案.

#include<bits/stdc++.h>
using namespace std;
typedef long long lnt;
const int maxn = 2e3;
const lnt inf = 1e14;
int pos, cnt, n, m, id[maxn], vis[maxn], pre[maxn];
lnt ret, sum, in[maxn];
struct edg{ int u, v, w; }edge[maxn * maxn];
inline lnt zhuliu(int root, int V, int E) {
	lnt tmp = 0;
	while (true) {
		for (int i = 0; i < V; ++ i) in[i] = inf;
		for (int i = 0; i < E; ++ i) {
			int u = edge[i].u, v = edge[i].v;
			if (u != v && in[v] > edge[i].w) {
				in[v] = edge[i].w;
				pre[v] = u;
				if (u == root) pos = i;
			}
		}
		for (int i = 0; i < V; ++ i)
			if (in[i] == inf && i != root) return -1;
        int cnt = 0;
        memset(id , -1 , sizeof(id));
        memset(vis , -1 , sizeof(vis));
        in[root] = 0;
		for (int i = 0; i < V; ++ i) {
			int v = i;
			tmp += in[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] = cnt;
				id[v] = cnt ++;
			}
		}
		if (!cnt) break;
		for (int i = 0; i < V; ++ i)
			if (id[i] == -1) id[i] = cnt ++;
		for (int i = 0; i < E; ++ i) {
			int u = edge[i].u, v = edge[i].v;
			edge[i].u = id[u], edge[i].v = id[v];
			if (id[u] != id[v]) edge[i].w -= in[v];
		}
		V = cnt, root = id[root];
	}
	return tmp;
}
int main() {
	while (~ scanf("%d%d", &n, &m)) {
		sum = 1;
		for (int i = 0; i < m; ++ i) {
			scanf("%d%d%d", &edge[i].u, &edge[i].v, &edge[i].w);
			edge[i].u ++, edge[i].v ++;
			sum += edge[i].w;
		}
		for (int i = m; i < n + m; ++ i)
			edge[i].u = 0, edge[i].v = i - m + 1, edge[i].w = sum;
		ret = zhuliu(0, n + 1, n + m);
		if (ret == -1 || ret - sum >= sum) printf("impossible\n\n");
		else printf("%lld %d\n\n", ret - sum, pos - m);
	}
}