hdu5934(tarjan缩点)

一堆炸药桶放在平面上，每个炸药爆炸范围不同，点燃每个炸药花费不同，求引爆所以炸药的最小花费

枚举任意两个炸药桶建立单向边，进行缩点，被缩成同一点的几个炸药桶说明点燃这几个炸药桶的任意一个都能把这一片都引爆。

缩完点后，建立一个新的图，并把每个被缩点的炸药桶的最小化费来代替这个点的花费，最后把所有入度为0的点的花费加起来就行

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <set>

using namespace std;
typedef long long ll;
const int mx = 1005;
int n,cnt,sum,top,low[mx],dfn[mx],stack[mx],vis[mx],color[mx],ans[mx],in[mx];
vector <int> G[mx];
int mat[mx][mx];
struct node
{
	int x,y,r,c;
}pt[mx];

double calc(node a,node b)
{
	double dis = sqrt((1LL*a.x-b.x)*(1LL*a.x-b.x) + (1LL*a.y-b.y)*(1LL*a.y-b.y));
	return dis;
}

void tarjan(int u)
{
	low[u] = dfn[u] = ++cnt;
	stack[++top] = u;
	vis[u] = true;
	int v, len = G[u].size();
	
	for (int i = 0; i < len; i++)
	{
		v = G[u][i];
		if (!dfn[v])
		{
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if (vis[v])
			low[u] = min(low[u], dfn[v]);
	}
	if (low[u] == dfn[u])
	{
		color[u] = ++sum;
		while (stack[top] != u)
		{
			vis[stack[top]] = false;
			color[stack[top]] = sum;
			top--;
		}
		vis[u] = false;
		top--;
	}
}

void init()
{
	cnt = sum = top = 0;
	memset(vis, false, sizeof(vis));
	memset(dfn, 0, sizeof(dfn));
	memset(low, 0, sizeof(low));
	memset(ans,0x3f,sizeof(ans));
	memset(in,0,sizeof(in));
	memset(mat,0,sizeof(mat));
	for (int i = 0; i < mx; i++)
		G[i].clear();

}
int main()
{
	int T,kase = 0;
	scanf("%d",&T);
	
	while (T--)
	{
		++kase;
		init();
		scanf("%d",&n);
		for (int i = 1; i <= n; i++)
			scanf("%d%d%d%d",&pt[i].x,&pt[i].y,&pt[i].r,&pt[i].c);
		for (int i = 1; i <= n; i++)
		{
			for (int j = i+1; j <= n; j++)
			{
				double dis = calc(pt[i],pt[j]);
				if (dis <= pt[i].r) G[i].push_back(j);
				if (dis <= pt[j].r) G[j].push_back(i);
			}
		}
		
		for (int i = 1; i <= n; i++)
			if (!dfn[i])
				tarjan(i);
		for (int i = 1; i <= n; i++)
			ans[color[i]] = min(ans[color[i]],pt[i].c);
		
		
		//printf("sum = %d\n",sum);
		int v;
		for (int i = 1; i <= n; i++)
		{
			int len = G[i].size();
			for (int j = 0; j < len; j++)
			{
				v = G[i][j];
				if (color[i] != color[v])
					mat[color[i]][color[v]] = 1;
			}
		}
		
		for (int i = 1; i <= sum; i++)
		{
			for (int j = 1; j <= sum; j++)
			{
				if (mat[i][j])
					in[j]++;
			}
		}
		
		long long Ans = 0;
		for (int i = 1; i <= sum; i++)
			if (in[i] == 0)
				Ans += ans[i];
		printf("Case #%d: %lld\n",kase,Ans);
	}
	
	return 0;
}