hdu 4738 Caocao's Bridges

http://acm.hdu.edu.cn/showproblem.php?pid=4738

Caocao's Bridges 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 <= N 2 ) 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. Sample Input 3 3 1 2 7 2 3 4 3 1 4 3 2 1 2 7 2 3 4 0 0 Sample Output -1 4

题目大意：
曹操有很多岛屿，然后呢需要建造一些桥梁将所有的岛屿链接起来，周瑜要做的是就是不让曹操将所有岛屿连接起来，每个座桥有人在守卫， 周瑜只能炸一座桥，并且他派人去炸桥只能派的人数必须 大于等于守桥的人数。
输出最小的炸桥人数， 要是没有答案就输出 -1

///#pragma comment (linker, "/STACK:102400000,102400000")

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <stack>
#include <vector>
#include <map>

using namespace std;

#define N 1350
#define INF 0xfffffff
#define PI acos (-1.0)
#define EPS 1e-8

struct node
{
    int v, next, flow;
} edge[N * N];

int n, m, Time, minx, low[N], dfn[N], f[N], head[N], cnt;
vector <vector <int> > G;

void Init ();
void addedge (int u, int v, int flow);
void tarjan (int u, int fa);
void solve ();

int main ()
{
    while (scanf ("%d %d", &n, &m), n+m)
    {
        Init ();
        for (int i=0; i<m; i++)
        {
            int u, v, flow;
            scanf ("%d %d %d", &u, &v, &flow);
            addedge (u, v, flow);
            addedge (v, u, flow);
        }
        int k = 0;
        minx = INF;
        for (int i=1; i<=n; i++)
            if (!low[i])
            {
                tarjan (i, -1);
                k++;
            }
        if (k > 1)
        {
            puts ("0");
            continue;
        }
        if (!minx) minx = 1;
        else if (minx == INF)
            minx = -1;
        printf ("%d\n", minx);
    }
    return 0;
}

void Init ()
{
    Time = cnt = 0;
    memset (head, -1, sizeof (head));
    memset (low, 0, sizeof (low));
    memset (dfn, 0, sizeof (dfn));
    memset (f, 0, sizeof (f));
}

void addedge (int u, int v, int flow)
{
    edge[cnt].v = v;
    edge[cnt].flow = flow;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}

void tarjan (int u, int fa)
{
    f[u] = fa;
    low[u] = dfn[u] = ++Time;
    int k = 0;

    for (int i=head[u]; i!=-1; i=edge[i].next)
    {
        int v = edge[i].v;
        if (fa == v && !k)
        {
            k++;
            continue;
        }
        if (!low[v])
        {
            tarjan (v, u);
            low[u] = min (low[u], low[v]);
            if (low[v] > dfn[u]) minx = min (minx, edge[i].flow);
        }
        else low[u] = min (low[u], dfn[v]);
    }
}

Caocao's Bridges Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2613    Accepted Submission(s): 846 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 <= N 2 ) 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.   Sample Input 3 3 1 2 7 2 3 4 3 1 4 3 2 1 2 7 2 3 4 0 0   Sample Output -1 4