【（最小权点基）tarjan强连通分量缩点+tarjan模板】HDU 5934 Bomb

【AC】

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 int n;
 const int maxn=1e3+;
 const int maxm=1e6+;
 const int inf=0x3f3f3f3f;
 struct node
 {
     double x;
     double y;
     double r;
     int c;
 }a[maxn];
 struct edge
 {
     int to;
     int nxt;
 }e[maxm];
 int head[maxn],tot;
 int dfn[maxn],low[maxn],id;
 int S[maxn],top;
 int belong[maxn],num;
 int du[maxn];
 int w[maxn];
 bool vis[maxn];
 void init()
 {
     memset(head,-,sizeof(head));
     tot=;
     id=;
     top=;
     num=;
     memset(dfn,,sizeof(dfn));
     memset(low,,sizeof(low));
     memset(du,,sizeof(du));
     memset(w,inf,sizeof(w));
     memset(vis,false,sizeof(vis));
 }
 void addedge(int u,int v)
 {
     e[tot].to=v;
     e[tot].nxt=head[u];
     head[u]=tot++;
 }
 bool judge(int i,int j)
 {
     return sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y))<=a[i].r;
 }
 void tarjan(int u)
 {
     dfn[u]=low[u]=++id;
     S[++top]=u;
     vis[u]=true;
     for(int i=head[u];i!=-;i=e[i].nxt)
     {
         int v=e[i].to;
         if(!dfn[v])
         {
             tarjan(v);
             low[u]=min(low[u],low[v]);
         }
         else if(vis[v]) low[u]=min(low[u],dfn[v]);
     }
     if(dfn[u]==low[u])
     {
         num++;
         while()
         {
             belong[S[top]]=num;
             vis[S[top]]=false;
             w[num]=min(w[num],a[S[top]].c);
             if(S[top--]==u) break;
         }
     }
 }
 int main()
 {
     int T;
     scanf("%d",&T);
     int cas=;
     while(T--)
     {
         init();
         scanf("%d",&n);
         for(int i=;i<=n;i++)
         {
             scanf("%lf%lf%lf%d",&a[i].x,&a[i].y,&a[i].r,&a[i].c);
         }
         for(int i=;i<=n;i++)
         {
             for(int j=;j<=n;j++)
             {
                 if(j==i) continue;
                 if(judge(i,j))
                 {
                     addedge(i,j);
                 }
             }
         }
         for(int i=;i<=n;i++) if(!dfn[i]) tarjan(i);
         for(int u=;u<=n;u++)
         {
             for(int i=head[u];i!=-;i=e[i].nxt)
             {
                 int v=e[i].to;
                 if(belong[u]==belong[v]) continue;
                 du[belong[v]]++;
             }
         }
         int ans=;
         for(int i=;i<=num;i++)
         {
             int tmp=inf;
             if(du[i]==)
             {
                 ans+=w[i];
             }
         }
         printf("Case #%d: %d\n",++cas,ans);
     }
     return ;
 }