UVA 10480 Sabotage

Sabotage

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVA. Original ID: 10480
64-bit integer IO format: %lld      Java class name: Main

The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist military super power has decided to invade the country and reinstall the old regime.

For this operation to be successful, communication between the capital and the largest city must be completely cut. This is a difficult task, since all cities in the country are connected by a computer network using the Internet Protocol, which allows messages to take any path through the network. Because of this, the network must be completely split in two parts, with the capital in one part and the largest city in the other, and with no connections between the parts.

There are large differences in the costs of sabotaging different connections, since some are much more easy to get to than others.

Write a program that, given a network specification and the costs of sabotaging each connection, determines which connections to cut in order to separate the capital and the largest city to the lowest possible cost.

Input 

Input file contains several sets of input. The description of each set is given below.

The first line of each set has two integers, separated by a space: First one the number of cities, n in the network, which is at most 50. The second one is the total number of connections, m, at most 500.

The following m lines specify the connections. Each line has three parts separated by spaces: The first two are the cities tied together by that connection (numbers in the range 1 - n). Then follows the cost of cutting the connection (an integer in the range 1 to 40000000). Each pair of cites can appear at most once in this list.

Input is terminated by a case where values of n and m are zero. This case should not be processed. For every input set the capital is city number 1, and the largest city is number 2.

Output 

For each set of input you should produce several lines of output. The description of output for each set of input is given below:

The output for each set should be the pairs of cities (i.e. numbers) between which the connection should be cut (in any order), each pair on one line with the numbers separated by a space. If there is more than one solution, any one of them will do.

Print a blank line after the output for each set of input.

Sample Input 

5 8
1 4 30
1 3 70
5 3 20
4 3 5
4 5 15
5 2 10
3 2 25
2 4 50
5 8
1 4 30
1 3 70
5 3 20
4 3 5
4 5 15
5 2 10
3 2 25
2 4 50
0 0

Sample Output 

4 1
3 4
3 5
3 2

4 1
3 4
3 5
3 2

解题：最小割

#include <bits/stdc++.h>
using namespace std;
const int INF = ~0U>>2;
const int maxn = 110;
struct arc {
    int to,flow,next;
    arc(int x = 0,int y = 0,int z = -1) {
        to = x;
        flow = y;
        next = z;
    }
} e[maxn*maxn];
int head[maxn],gap[maxn],d[maxn],tot,S = 1,T = 2,n,m;
void add(int u,int v,int w) {
    e[tot] = arc(v,w,head[u]);
    head[u] = tot++;
    e[tot] = arc(u,w,head[v]);
    head[v] = tot++;
}
int dfs(int u,int low) {
    if(u == T) return low;
    int tmp = 0,minH = n - 1;
    for(int i = head[u]; ~i; i = e[i].next) {
        if(e[i].flow) {
            if(d[u] == d[e[i].to] + 1) {
                int a = dfs(e[i].to,min(low,e[i].flow));
                e[i].flow -= a;
                e[i^1].flow += a;
                tmp += a;
                low -= a;
                if(!low) break;
                if(d[S] >= n) return tmp;
            }
            if(e[i].flow) minH = min(minH,d[e[i].to]);
        }
    }
    if(!tmp) {
        if(--gap[d[u]] == 0) d[S] = n;
        ++gap[d[u] = minH + 1];
    }
    return tmp;
}
bool vis[maxn];
void dfs(int u) {
    vis[u] = true;
    for(int i = head[u]; ~i; i = e[i].next) {
        if(vis[e[i].to]) continue;
        if(e[i].flow) dfs(e[i].to);
    }
}
int main() {
    int u,v,w;
    while(scanf("%d%d",&n,&m),n||m) {
        memset(head,-1,sizeof head);
        memset(gap,0,sizeof gap);
        memset(d,0,sizeof d);
        for(int i = tot = 0; i < m; ++i) {
            scanf("%d%d%d",&u,&v,&w);
            add(u,v,w);
        }
        gap[S] = n;
        int ret = 0;
        while(d[S] < n) ret += dfs(S,INF);
        memset(vis,false,sizeof vis);
        dfs(S);
        for(int i = 1; i <= n; ++i)
        for(int j = head[i]; ~j; j = e[j].next){
            if(!e[j].flow && vis[i] != vis[e[j].to])
                printf("%d %d
",i,e[j].to);
        }
        puts("");
    }
    return 0;
}