hdu 4738 Caocao's Bridges

很裸的双向边强连通，一场比赛北大出题总会有一个坑，今天网赛就出现在此题上，注意炸掉一座桥，如果此前没守卫，也必须去一个士兵，神坑，后来有人在讨论板报复社会来着。

怒贴代码。。。。。

#include<cstdio>
#include<cstring>
#include<stack>
#include<cmath>
#include<iostream>
using namespace std;
#define N 1005


struct node{
    int from,to,next,l;
}edge[N*N*2],edge1[2*N*N];

int head[N],tol,toll,n,m,cnt,dfn[N],low[N],visit[N],Belong[N],head1[N],val[N],val1[N],sum,Min,count;

stack<int>S;


struct edge{
    int u;
    int v;
    int l;
}E[N*N*2];

void add(int a,int b)
{
    edge[tol].from=a;
    edge[tol].to=b;
    edge[tol].next=head[a];
    head[a]=tol++;
}

void add1(int a,int b,int c)
{
    edge1[toll].from=a;
    edge1[toll].to=b;
    edge1[toll].l=c;
    edge1[toll].next=head1[a];
    head1[a]=toll++;
}

void tarjan(int u,int f)
{
    int j,v,flag;
    dfn[u]=low[u]=cnt++;
    visit[u]=1;
    S.push(u);
    flag=0;
    for(j=head[u];j!=-1;j=edge[j].next)
    {
        v=edge[j].to;
        if(v==f && !flag) {flag=1;continue;}
        if(!visit[v]) tarjan(v,u);
        low[u]=min(low[u],low[v]);
    }
    if(dfn[u]==low[u])
    {
        count++;
        do{
            v=S.top();
            S.pop();
            Belong[v]=count;
            //val[count]+=val1[v];
        }while(v!=u);
    }
}


int main()
{
    int i,a,b,l;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0 && m==0) break;
        memset(head,-1,sizeof(head));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(Belong,-1,sizeof(Belong));
        memset(visit,0,sizeof(visit));
        tol=cnt=toll=0;
        sum=0;
        for(i=1;i<=m;i++)
        {
            scanf("%d%d%d",&E[i].u,&E[i].v,&E[i].l);
            add(E[i].u,E[i].v);
            add(E[i].v,E[i].u);
        }
        count=0;
        for(i=1;i<=n;i++){
            if(!visit[i])
                tarjan(i,-1),sum++;
        }
        //printf("D%d %d\n",sum,count);
        if(sum>1){
            printf("0\n");
            continue;
        }
        memset(head1,-1,sizeof(head1));
        for(i=1;i<=m;i++)
        {
            //scanf("%d%d%d",&E[i].u,&E[i].v,&E[i].l);
            int a=E[i].u,b=E[i].v;
            if(Belong[a]!=Belong[b]){

                add1(Belong[a],Belong[b],E[i].l);
                add1(Belong[b],Belong[a],E[i].l);
                //printf("a,b,toll: %d %d %d\n",Belong[a],Belong[b],toll);
            }
        }
        Min=1000000000;
        //printf("toll=%d\n",toll);
        if(count==1) {printf("-1\n");continue;}
        else{
            for(i=0;i<toll;i++){
               // printf("i= %d=n",edge1[i].l);
                if(Min>edge1[i].l)
                    Min=edge1[i].l;
            }
        }
        if(Min==0)  Min=1;
        printf("%d\n",Min);
    }
    return 0;
}