解题思路:
1)两遍for循环,如果 i 能引爆 j,则连一条i指向j的边。
2)求强连通分量
3)把属于同一连通分量的缩成一个点,构成新的有向无环图(DAG)
4)在DAG里,对于入度为0的点,在它原来的点中找到代价最小的点。
题目要求的用最少的代价引爆所有的炸弹,转换一下就是在DAG图里最少通过哪些点可以到达其它所有的点,在DAG图里,入度不为0的点一定可以由某个入度为0的点到达(由于无环,所以从任何入度不为0的 点往回走,必然终止于一个入度为0的点)
具体看代码吧
【代码】
/* ***********************************************
Author :angon
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 1005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}
struct Edge
{
int v,next;
}edge[N*N];
int head[N],tot;
int belong[N],Stack[N],inStack[N];
int low[N],dfn[N];
int scc,TimeN,top;
int in[N];
LL x[N],y[N],r[N];
int c[N];
void addedge(int u,int v)
{
edge[tot].v=v; edge[tot].next=head[u]; head[u] = tot++;
}
void tarjan(int u)
{
dfn[u] = low[u] = ++TimeN;
Stack[top++] = u;
inStack[u] = 1;
for(int i=head[u]; ~i; i=edge[i].next)
{
int v=edge[i].v;
if(!dfn[v])
{
tarjan(v);
low[u] = min(low[u],low[v]);
}
else if(inStack[v])
low[u] = min(low[u],dfn[v]);
}
if(dfn[u]==low[u])
{
int v;
scc++;
do
{
v = Stack[--top];
inStack[v] = 0;
belong[v] = scc;
}while(v!=u);
}
}
void init()
{
mst(head,-1); tot=0;
mst(inStack,0); mst(dfn,0);
scc = top = TimeN = 0;
mst(in,0);
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
int t,cas=1;
scan(t);
while(t--)
{
scan(n);
init();
REPP(i,1,n)
{
scannl(x[i],y[i]);
scanl(r[i]);
scan(c[i]);
}
REPP(i,1,n)
{
for(int j=1;j<=n;j++)
{
if(i==j) continue;
if(sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j])) <= r[i])
addedge(i,j);
}
}
REPP(u,1,n)
if(!dfn[u])
tarjan(u);
REPP(u,1,n)
{
for(int i=head[u]; ~i; i=edge[i].next)
{
int v=edge[i].v;
if(belong[u]==belong[v]) continue;
//out[belong[u]]++;
in[belong[v]]++;
}
}
int ans=0;
REPP(i,1,scc)
{
if(in[i]==0)
{
int tmp = 1e5;
for(int j = 1;j<=n;j++)
{
if(belong[j] == i)
{
//printf("%d belong %d\n",j ,i);
tmp = min(tmp,c[j]);
}
}
ans += tmp;
}
}
printf("Case #%d: %d\n",cas++,ans);//max(r,c));
}
return 0;
}