poj 3204(最小割--关键割边)

Ikki's Story I - Road Reconstruction

Time Limit: 2000MS		Memory Limit: 131072K
Total Submissions: 7491		Accepted: 2172

Description

Ikki is the king of a small country – Phoenix, Phoenix is so small that there is only one city that is responsible for the production of daily goods, and uses the road network to transport the goods to the capital. Ikki finds that the biggest problem in the country is that transportation speed is too slow.

Since Ikki was an ACM/ICPC contestant before, he realized that this, indeed, is a maximum flow problem. He coded a maximum flow program and found the answer. Not satisfied with the current status of the transportation speed, he wants to increase the transportation ability of the nation. The method is relatively simple, Ikki will reconstruct some roads in this transportation network, to make those roads afford higher capacity in transportation. But unfortunately, the country of Phoenix is not so rich in GDP that there is only enough money to rebuild one road. Ikki wants to find such roads that if reconstructed, the total capacity of transportation will increase.

He thought this problem for a loooong time but cannot get it. So he gave this problem to frkstyc, who put it in this POJ Monthly contest for you to solve. Can you solve it for Ikki?

Input

The input contains exactly one test case.

The first line of the test case contains two integers N, M (N ≤ 500, M ≤ 5,000) which represents the number of cities and roads in the country, Phoenix, respectively.

M lines follow, each line contains three integers a, b, c, which means that there is a road from city a to city b with a transportation capacity of c (0 ≤ a, b < n, c ≤ 100). All the roads are directed.

Cities are numbered from 0 to n − 1, the city which can product goods is numbered 0, and the capital is numbered n − 1.

Output

You should output one line consisting of only one integer K, denoting that there are K roads, reconstructing each of which will increase the network transportation capacity.

Sample Input

2 1
0 1 1

Sample Output

1

题意:从源点0到汇点n-1，问给那些边增加容量会增大整个网络的容量？？输出边的数量。
这里有个重要的概念：关键边，关键边定义为 :通过增加某个边的容量使得网络的最大流增加
个人的理解为最小割里面的边一定是关键割边，但关键割边不一定是最小割。
这题的做法是先求一次最大流，然后对残余网络进行两次DFS，从源点的DFS很简单，从正向边搜到边的容量为0即可，得到点集A，标记；主要是从汇点进行第二次DFS，这里就要用到技巧了，网络流有个神奇的反向边，我们从反向边进行DFS（也要判断一下正向边是否为0）得到点集B，标记；然后遍历所有的边，如果某条边的两个端点分别属于点集 A,B，那么这条边肯定就是关键割边，记录之。

#include <stdio.h>
#include <algorithm>
#include <queue>
#include <string.h>
#include <math.h>
#include <iostream>
#include <math.h>
using namespace std;
const int N = ;
const int INF = ;
struct Edge
{
    int v,next;
    int w;
} edge[N*N];
int head[N];
int level[N];
int tot;
void init()
{
    memset(head,-,sizeof(head));
    tot=;
}
void addEdge(int u,int v,int w,int &k)
{
    edge[k].v = v,edge[k].w=w,edge[k].next=head[u],head[u]=k++;
    edge[k].v = u,edge[k].w=,edge[k].next=head[v],head[v]=k++;
}
int BFS(int src,int des)
{
    queue<int >q;
    memset(level,,sizeof(level));
    level[src]=;
    q.push(src);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        if(u==des) return ;
        for(int k = head[u]; k!=-; k=edge[k].next)
        {
            int v = edge[k].v;
            int w = edge[k].w;
            if(level[v]==&&w!=)
            {
                level[v]=level[u]+;
                q.push(v);
            }
        }
    }
    return -;
}
int dfs(int u,int des,int increaseRoad)
{
    if(u==des) return increaseRoad;
    int ret=;
    for(int k=head[u]; k!=-; k=edge[k].next)
    {
        int v = edge[k].v;
        int w = edge[k].w;
        if(level[v]==level[u]+&&w!=)
        {
            int MIN = min(increaseRoad-ret,w);
            w = dfs(v,des,MIN);
            if(w>)
            {
                edge[k].w -=w;
                edge[k^].w+=w;
                ret+=w;
                if(ret==increaseRoad) return ret;
            }
            else level[v] = -;
        }
    }
    return ret;
}
int Dinic(int src,int des)
{
    int ans = ;
    while(BFS(src,des)!=-) ans+=dfs(src,des,INF);
    return ans;
}
int vis[N];
void dfs0(int u)
{
    vis[u] = ;
    for(int k=head[u]; k!=-; k=edge[k].next)
    {
        int v = edge[k].v,w = edge[k].w;

        if(!vis[v]&&w>)
        {
            dfs0(v);
        }
    }
}
void dfs1(int u)
{
    vis[u] = ;
    for(int k=head[u]; k!=-; k=edge[k].next)
    {
        int v = edge[k].v;
        if(!vis[v]&&edge[k^].w>&&edge[k].w>) ///汇点利用反向边进行搜索,这里还要判断一下正向边是否大于0
        {
            dfs1(v);
        }
    }
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    init();
    for(int i=; i<m; i++)
    {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        if(u==v) continue;
        addEdge(u,v,w,tot);
    }
    memset(vis,,sizeof(vis));
    Dinic(,n-);
    dfs0();
    dfs1(n-);
    int ans = ;
    for(int u=; u<n; u++)
    {
        for(int k=head[u]; k!=-; k=edge[k].next)
        {
            if(k%==) continue; ///只考虑正向边
            if(vis[u]==&&vis[edge[k].v]==) ans++;
        }
    }
    printf("%d\n",ans);
}