HDU 3549 Flow Problem 网络流 EK
来源:互联网 发布:手机怎么改淘宝店铺名 编辑:程序博客网 时间:2024/04/29 10:30
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)
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
23 21 2 12 3 13 31 2 12 3 11 3 1
Sample Output
Case 1: 1Case 2: 2
Author
HyperHexagon
Source
HyperHexagon's Summer Gift (Original tasks)
就是网络流的裸题。
这回练一下EK。。说实话EK真的好懂又好写。。
就是不停广搜找增广路,找到之后流量都减一遍,直到找不到增广路就好了。
可惜O(V*E^2)有局限。。稀疏图真的不错的。
其实这题也可以用EK做:poj1273
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#define N 1005using namespace std;int n,m;bool visit[N];int map[N][N];int Q[N],pre[N];bool EdKa(int src,int des,int n){ int v,i,head,tail; memset(visit,0,sizeof(visit)); head=tail=0; Q[tail++]=src; visit[src]=true; while (head!=tail) { v=Q[head++]; for (i=1;i<=n;i++) if (!visit[i] && map[v][i]) { Q[tail++]=i; visit[i]=true; pre[i]=v; if (i==des) return true; } } return false;}int maxflow(int src,int des,int n){ int i,_min,sum=0; while (true) { if (!EdKa(src,des,n)) return sum; _min=(1<<30); i=des; while (i!=src) { if (_min>map[pre[i]][i]) _min=map[pre[i]][i]; i=pre[i]; } i=des; while (i!=src) { map[pre[i]][i]-=_min; map[i][pre[i]]+=_min; i=pre[i]; } sum+=_min; }}int main(){ int T,cas; scanf("%d",&T); for (cas=1;cas<=T;cas++) { memset(map,0,sizeof(map)); int x,y,z,j; scanf("%d%d",&n,&m); for (j=1;j<=m;j++) { scanf("%d%d%d",&x,&y,&z); map[x][y]+=z; } printf("Case %d: %d\n",cas,maxflow(1,n,n)); }}
阅读全文
0 0
- HDU 3549 Flow Problem 网络流 EK
- HDU- 3549-Flow Problem (网络流之 EK)
- hdu 3549 Flow Problem ek算法,网络流
- hdu 3549 Flow Problem EK算法 网络流
- hdu 3549 Flow Problem (EK 最大流)
- 【最大流(EK)】hdu 3549 Flow Problem
- hdu 3549 Flow Problem(最大流EK算法模板)
- HDU 3549 Flow Problem ( 最大流 -EK 算法)
- hdu 3549 Flow Problem (最大流—EK—Dinic)
- HDU 3549 Flow Problem【最大流模板题,EK算法】
- hdu 3549 Flow Problem(最大流 EK,sap)
- hdu 3549 EK算法 Flow Problem
- hdu 3549 Flow Problem(EK)
- hdu 1532 Drainage Ditches 和hdu 3549 Flow Problem 网络流入门(EK和dinic)
- HDU 3549 Flow Problem 解题报告(EK)算法
- hdu 3549 Flow Problem 最大流入门 EK算法
- hdu 3549 Flow Problem (ek算法模板)
- HDU 3549 Flow Problem(最大流裸题,EK解法)
- Mybatis--动态SQL
- ImportError: cannot import name 'etree'解决方案
- php常用数组函数粗略
- TSLint: The selector of the component "xxx" should have prefix "app" (https://goo.gl/cix8BY) (
- zookeeper 入门讲解实例 转
- HDU 3549 Flow Problem 网络流 EK
- 3D导航栏demo
- 对文件内容的操作NSHandle
- 编写snort 规则
- 简单的Python 爬虫
- mybatis缓存的使用及理解
- Android 主线程向子线程发出通讯
- [LeetCode] Target Sum
- Andorid N 最近任务管理器流程详解(一)