hdu3549--Flow Problem(初识最大流)

Flow Problem

Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)

Total Submission(s): 7870    Accepted Submission(s): 3664

Problem 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

 

第一次接触最大流,水题练手,使用了EK的方法,这个题不需要考虑建图,直接使用模板

 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define maxn 2100
#define INF 0x3f3f3f3f
struct edge{
    int v , w ;
    int next ;
} p[maxn];
int head[maxn] , cnt , vis[maxn] , pre[maxn];
queue <int> q ;
void add(int u,int v,int w)
{
    p[cnt].v = v ; p[cnt].w = w ;
    p[cnt].next = head[u] ; head[u] = cnt++ ;
    p[cnt].v = u ; p[cnt].w = 0 ;
    p[cnt].next = head[v] ; head[v] = cnt++ ;
}
int bfs(int s,int t)
{
    int u , v , i , min1 = INF ;
    while( !q.empty() )
        q.pop() ;
    memset(vis,0,sizeof(vis));
    vis[s] = 1 ;
    q.push(s) ;
    while(!q.empty())
    {
        u = q.front() ;
        q.pop();
        for(i = head[u] ; i != -1 ; i = p[i].next )
        {
            v = p[i].v ;
            if( !vis[v] && p[i].w )
            {
                vis[v] = 1 ;
                min1 = min(min1,p[i].w);
                pre[v] = i ;
                q.push(v) ;
            }
        }
    }
    if(vis[t])
        return min1 ;
    return -1 ;
}
int main()
{
    int tt , t , n , m , i , u , v , w , max_flow;
    scanf("%d", &t);
    for(tt = 1 ; tt <= t ; tt++)
    {
        cnt = 0 ; max_flow = 0 ;
        memset(head,-1,sizeof(head));
        scanf("%d %d", &n, &m);
        while(m--)
        {
            scanf("%d %d %d", &u, &v, &w);
            add(u,v,w);
        }
        memset(pre,-1,sizeof(pre));
        while(1)
        {
            int k = bfs(1,n);
            if(k == -1)
                break;
            max_flow += k ;
            for(i = pre[n] ; i != -1 ; i = pre[ p[ i^1 ].v ] )
            {
                p[i].w -= k ;
                p[i^1].w += k ;
            }
        }
        printf("Case %d: %d\n", tt, max_flow);
    }
    return 0;
}

hdu3549--Flow Problem(初识最大流)

时间: 2024-10-17 10:53:39

hdu3549--Flow Problem(初识最大流)的相关文章

HDU3549 Flow Problem 【最大流】

Flow Problem Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 8387    Accepted Submission(s): 3908 Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, y

HDU3549 Flow Problem【最大流】【Edmond-Karp】

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=3549 题目大意: 给你一个N个节点M条边的加权有向图,源点为1,汇点为N,求此图的最大流. 思路: 这道题就是网络流求最大流的裸题.直接用Edmond-Karp算法来做就可以了. AC代码: #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<

hdu3549 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 d

hdu 3549 Flow Problem(最大流模板题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3549 Problem 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

hdu 3549 Flow Problem (网络最大流)

Flow Problem Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 6674    Accepted Submission(s): 3112 Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, yo

HDU 3549 Flow Problem (最大流ISAP)

Flow Problem Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8199    Accepted Submission(s): 3814 Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, yo

hdoj 3549 Flow Problem 【最大流】

题目:hdoj 3549 Flow Problem 题意:给出一个图,让你求最大流. 分析:这个题目用dinci写的,因为点比较少,而dinci复杂度O(m*n^2),但是还是跑了160ms,不知道15的神牛怎么写的. dinci的写法要注意的地方就是存图的时候要考虑怎么存,因为要更新网络残量,即反向的流量,所以这里要注意一下. 思想就不讲了,很多地方有讲. 代码: #include <cstdio> #include <cstring> #include <iostream

HDU 3549 Flow Problem(最大流)

Flow Problem Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 12625    Accepted Submission(s): 6004 Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph,

[ACM] hdu 3549 Flow Problem (最大流模板题)

Flow Problem Problem 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 nu