【HUD】4738Caocao's Bridges（无向图重边的tarjan）

Problem Description

Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another idea. He built many islands in the Changjiang river, and based on those islands, Caocao's army could easily attack Zhou Yu's troop. Caocao also built bridges connecting islands. If all islands were connected by bridges, Caocao's army could be deployed very conveniently among those islands. Zhou Yu couldn't stand with that, so he wanted to destroy some Caocao's bridges so one or more islands would be seperated from other islands. But Zhou Yu had only one bomb which was left by Zhuge Liang, so he could only destroy one bridge. Zhou Yu must send someone carrying the bomb to destroy the bridge. There might be guards on bridges. The soldier number of the bombing team couldn't be less than the guard number of a bridge, or the mission would fail. Please figure out as least how many soldiers Zhou Yu have to sent to complete the island seperating mission.

 

 

Input

There are no more than 12 test cases.

In each test case:

The first line contains two integers, N and M, meaning that there are N islands and M bridges. All the islands are numbered from 1 to N. ( 2 <= N <= 1000, 0 < M <= N2 )

Next M lines describes M bridges. Each line contains three integers U,V and W, meaning that there is a bridge connecting island U and island V, and there are W guards on that bridge. ( U ≠ V and 0 <= W <= 10,000 )

The input ends with N = 0 and M = 0.

 

 

Output

For each test case, print the minimum soldier number Zhou Yu had to send to complete the mission. If Zhou Yu couldn't succeed any way, print -1 instead.

题目大意：曹操的的部队要在一个岛上，然后这个岛是由很多小岛组成的，链接这些小岛的正是一个个的桥，然后现在我们想让曹操首尾不能相顾，所以我们要派人去吧那个桥给炸掉，然后曹操给他的桥上派了一些小兵，然后如果我们想要拆掉某一个桥，那么我们至少要派出与在桥上的曹操的小兵数量相等的小兵数才能拆掉桥，问最小需要多少小兵

思路：首先这个题目之前没有看到的是重边，这个如果继续用vector去处理的话感觉是不行的，因为我们可以从fa -> i ->fa

这样就是不能保存重边了，看网上的一些题解发现可以用邻接表来做，然后把每一条无向边改成有向边，然后我们在建边的时候一条边拆出来的两条边是相邻的，我们就可以用相邻的这个特点把他回到fa的这个点给去掉，

还有就是要注意一些wa点，这个题目如果他的小岛本来就是不连通的，那么我们不需要派出小兵，输出0

如果某一个桥的小兵数量是0，那么我们其实是要至少派出一个小兵拆桥的。。。

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
const int maxn=1000+10;
const int maxm=1000*1000*2+10;
int n,m;
int tot;
int head[maxn];
struct Edge
{
    int to,next,w;
    Edge(){}
    Edge(int to,int next,int w):to(to),next(next),w(w){}
}edges[maxm];
void add_edge(int u,int v,int w)
{
    edges[tot]=Edge(v,head[u],w);
    head[u]=tot++;
    edges[tot]=Edge(u,head[v],w);
    head[v]=tot++;
}
int pre[maxn],low[maxn];
int dfs_clock,point_num;
int ans;
void tarjan(int u,int E)
{
    low[u]=pre[u]=++dfs_clock;
    for(int e=head[u];e!=-1;e=edges[e].next)
    {
        int v=edges[e].to;
        if(e==(E^1)) continue;
        if(pre[v]==0)
        {
            tarjan(v,e);
            low[u]=min(low[u],low[v]);
            if(low[v]>pre[u])
            {
                ans=min(ans,edges[e].w);
            }
        }
        else
            low[u]=min(low[u],pre[v]);
    }
    point_num++;
}
int main()
{
    while(scanf("%d%d",&n,&m)&&n+m)
    {
        memset(head,-1,sizeof(head));
        memset(pre,0,sizeof(pre));
        memset(low,0,sizeof(low));
        dfs_clock=0,point_num=0,tot=0;
        ans=100000;
        for(int i=1;i<=m;i++)
        {
            int x,y,dist;
            scanf("%d%d%d",&x,&y,&dist);
            add_edge(x,y,dist);
        }
        tarjan(1,-1);
        //cout<<"point_num :"<<point_num<<endl;
        if(point_num<n)printf("0\n");
        else if(ans==100000)printf("-1\n");
        else if(ans==0)printf("1\n");
        else printf("%d\n",ans);
    }
}