HDU 3549 Flow Problem

Flow Problem

Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

 

Input

The first line of input contains an integer T, denoting the number of test cases. 
For each test case, the first line contains two integers N and M, denoting the number of vertexes and edges in the graph. (2 <= N <= 15, 0 <= M <= 1000) 
Next M lines, each line contains three integers X, Y and C, there is an edge from X to Y and the capacity of it is C. (1 <= X, Y <= N, 1 <= C <= 1000)

 

Output

For each test cases, you should output the maximum flow from source 1 to sink N.

 

Sample Input

     

       2
3 2
1 2 1
2 3 1
3 3
1 2 1
2 3 1
1 3 1 
     

 

Sample Output

     

       Case 1: 1
Case 2: 2 
     

 

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<queue>
#include<algorithm>

#define INF 0x7fffffff
#define N 100

using namespace std;

int map[N][N],v[N];
int pre[N];
int n,m;

int BFS(int s,int t)
{
    queue<int>q;
    memset(pre,-1,sizeof(pre));
    memset(v,0,sizeof(v));
    pre[s] = s;
    v[s] = 1;
    q.push(s);
    int i;
    while(!q.empty())
    {
        int w = q.front();
        q.pop();
        for(i=1;i<=n;i++)
        {
            if(map[w][i]&&v[i] == 0)
            {
                pre[i] = w;
                v[i] = 1;
                if(i == t)
                {
                    return 1;
                }
                q.push(i);
            }
        }
    }
    return 0;
}

int EK(int s,int t)
{
    int count = 0;
    int i,pp;
    while(BFS(s,t) == 1)
    {
        pp = INF;
        for(i=t;i!=s;i = pre[i])
        {
            if(pp>=map[pre[i]][i])
            {
                pp = map[pre[i]][i];
            }
        }
        for(i=t;i!=s;i=pre[i])
        {
            map[pre[i]][i] -= pp;
            map[i][pre[i]] += pp;
        }
        count += pp;
    }
    return count;
}

int main()
{
    int T,t=0,i,j;
    scanf("%d",&T);
    while(T--)
    {
        t++;
        int x,y,z;
        scanf("%d%d",&n,&m);
        memset(map,0,sizeof(map));
        while(m--)
        {
            scanf("%d%d%d",&x,&y,&z);
            map[x][y] += z;
        }
        printf("Case %d: %d\n",t,EK(1,n));
    }
    return 0;
}