最小树形图 hdu4966

不能多说

O(n^3)

#include <cstdio>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
//#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Debug(x) (cerr << #x << " = " << (x) << endl)
#define Debug2(x, y) (cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl)
#define FORIT(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)


template<class T> inline T& RD(T &x){
	char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
	return x;
}
inline void outarray(int ar[], int n){
	for (int i = 0; i<n; i++){
		printf("%d%c", ar[i], i == n - 1 ? '\n' : ' ');
	}
}
const int maxn = 600;
const int mod = 1e9 + 7;
const int maxe = 2005 * 4;
const int inf = 0x3f3f3f3f;

int a[55];
int id[55][550];
int g[1000][1000];
int n,root;
int used[maxn],pass[maxn],eg[maxn],more,queue[maxn];


void combine(int id,int &sum){
	int tot = 0,from,i,j,k;
	for(;id!=0 && !pass[id];id=eg[id]){
		queue[tot++] = id;
		pass[id] = 1;
	}
	for(from = 0;from < tot && queue[from] != id;++from);
	if(from == tot)return ;
	more = 1;
	for(i=from;i<tot;i++){
		sum += g[eg[queue[i]]][queue[i]];
		if(i != from){
			used[queue[i]] = 1;
			for(j=1;j<=n;j++)if(!used[j]){
				if(g[queue[i]][j] < g[id][j]){
					g[id][j] = g[queue[i]][j];
				}
			}
		}
	}
	for(i=1;i<=n;i++){
		if(!used[i] && i != id){
			for(j=from;j<tot;j++){
				k = queue[j];
				if(g[i][id] > g[i][k]- g[eg[k]][k])
					g[i][id] = g[i][k] - g[eg[k]][k];
			}
		}	
	}
}
int mdst(int root){
	int i,j,k;
	int sum = 0;
	memset(used,0,sizeof(used));
	for(more=1;more;){
		more = 0;
		memset(eg,0,sizeof(eg));
		for(i=1;i<=n;i++)if(!used[i] && i != root){
			for(j=1,k=0;j<=n;j++){
				if(!used[j] && i != j){
					if(k == 0 || g[j][i] < g[k][i]){
						k = j;
					}
				}
			}
			eg[i] = k;
		}
		memset(pass,0,sizeof(pass));
		for(i=1;i<=n;i++){
			if(!used[i] && !pass[i] && i != root){
				combine(i,sum);
			}
		}
	}
	for(i=1;i<=n;i++)if(!used[i] && i!=root)sum += g[eg[i]][i];
	return sum;
}
int ss ;
void dfs(int u){
	used[u] = 1;
	ss ++;
	for(int i=1;i<=n;i++){
		if(g[u][i] != inf && used[i] == 0){
			dfs(i);
		}
	}
}
int main(){
	int m;
	while (1){
		scanf("%d%d", &n, &m);
		if(n == 0 && m == 0)break;
		int cnt = 2;
		root = 1;
		memset(g,0x3f,sizeof(g));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			for(int ii=0;ii<=a[i];ii++){
				id[i][ii] = cnt ++;
			}
			for(int ii=a[i];ii>=1;ii--){
				g[id[i][ii]][id[i][ii-1]] = 0;
			}
			g[root][id[i][0]] = 0;
		}
		while(m --){
			int c,l1,d,l2,mon;
			scanf("%d%d%d%d%d",&c,&l1,&d,&l2,&mon);
			g[id[c][l1]][id[d][l2]] = min(mon,g[id[c][l1]][id[d][l2]]);
		}
		n = cnt - 1;
		ss = 0;
		memset(used,0,sizeof(used));
		dfs(root);
		if(ss != n){
			cout << -1 << endl;
			continue;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				//printf("%d%c",g[i][j],j==n?'\n':' ');
			}	
		}
		int ans = mdst(root);
		if(ss == n)cout << ans << endl;
		else cout << -1 << endl;
	}
}