【HDU4280】【最大流模板题】
来源:互联网 发布:伤感网络女歌手有哪些 编辑:程序博客网 时间:2024/05/21 02:53
Island Transport
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6668 Accepted Submission(s): 2091
Problem Description
In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships.
You have a transportation company there. Some routes are opened for passengers. Each route is a straight line connecting two different islands, and it is bidirectional. Within an hour, a route can transport a certain number of passengers in one direction. For safety, no two routes are cross or overlap and no routes will pass an island except the departing island and the arriving island. Each island can be treated as a point on the XY plane coordinate system. X coordinate increase from west to east, and Y coordinate increase from south to north.
The transport capacity is important to you. Suppose many passengers depart from the westernmost island and would like to arrive at the easternmost island, the maximum number of passengers arrive at the latter within every hour is the transport capacity. Please calculate it.
You have a transportation company there. Some routes are opened for passengers. Each route is a straight line connecting two different islands, and it is bidirectional. Within an hour, a route can transport a certain number of passengers in one direction. For safety, no two routes are cross or overlap and no routes will pass an island except the departing island and the arriving island. Each island can be treated as a point on the XY plane coordinate system. X coordinate increase from west to east, and Y coordinate increase from south to north.
The transport capacity is important to you. Suppose many passengers depart from the westernmost island and would like to arrive at the easternmost island, the maximum number of passengers arrive at the latter within every hour is the transport capacity. Please calculate it.
Input
The first line contains one integer T (1<=T<=20), the number of test cases.
Then T test cases follow. The first line of each test case contains two integers N and M (2<=N,M<=100000), the number of islands and the number of routes. Islands are number from 1 to N.
Then N lines follow. Each line contain two integers, the X and Y coordinate of an island. The K-th line in the N lines describes the island K. The absolute values of all the coordinates are no more than 100000.
Then M lines follow. Each line contains three integers I1, I2 (1<=I1,I2<=N) and C (1<=C<=10000) . It means there is a route connecting island I1 and island I2, and it can transport C passengers in one direction within an hour.
It is guaranteed that the routes obey the rules described above. There is only one island is westernmost and only one island is easternmost. No two islands would have the same coordinates. Each island can go to any other island by the routes.
Then T test cases follow. The first line of each test case contains two integers N and M (2<=N,M<=100000), the number of islands and the number of routes. Islands are number from 1 to N.
Then N lines follow. Each line contain two integers, the X and Y coordinate of an island. The K-th line in the N lines describes the island K. The absolute values of all the coordinates are no more than 100000.
Then M lines follow. Each line contains three integers I1, I2 (1<=I1,I2<=N) and C (1<=C<=10000) . It means there is a route connecting island I1 and island I2, and it can transport C passengers in one direction within an hour.
It is guaranteed that the routes obey the rules described above. There is only one island is westernmost and only one island is easternmost. No two islands would have the same coordinates. Each island can go to any other island by the routes.
Output
For each test case, output an integer in one line, the transport capacity.
Sample Input
25 73 33 03 10 04 51 3 32 3 42 4 31 5 64 5 31 4 43 4 26 7-1 -10 10 21 01 12 31 2 12 3 64 5 55 6 31 4 62 5 53 6 4
Sample Output
96
Source
2012 ACM/ICPC Asia Regional Tianjin Online
Recommend
liuyiding
Max_Flow<int> MF;int main(){ scanf("%d",&T);while(T --){int xleft,xright,xleftid,xrightid;xleft = 0x3f3f3f3f;xright = -0x3f3f3f3f;scanf("%d%d",&n,&m);MF.Init(n+2,0,n+1);for(int i=1;i<=n;i++){int x,y;scanf("%d%d",&x,&y);if(x < xleft){xleft = x;xleftid = i;}if(x > xright){xright = x;xrightid = i;}}for(int i=0;i<m;i++){int u,v,w;scanf("%d%d%d",&u,&v,&w);MF.Add_edge(u,v,w);MF.Add_edge(v,u,w);}MF.Changest(xleftid,xrightid);printf("%d\n",MF.Dinic());} return 0;}
0 0
- 【HDU4280】【最大流模板题】
- hdu4280 Island Transport 最大流 ISAP模板题
- hdu4280 最大流DINIC
- hdu4280 Island Transport (网络流最大流)&(dinic算法模板)
- hdu4280 Island Transport 最大流模板Dinic算法
- hdu4280 Island Transport (网络流最大流)
- hdu4280 Island Transport (最大流ISAP算法)
- hdu4280 Island Transport 最大流dinic
- HDU4280 Island Transport【最大流】【SAP】
- 网络流Dinic邻接表(模板)--hdu4280
- HDU4280(Island Transport )最大流SAP算法+当前弧优化
- hdu4280——Island Transport(最大流SAP算法)
- HDU4280 Island Transport 网络流模版题
- hdu4280 (网络流大水题)--by lethalboy
- hdu4280 Island Transport(最大流入门)
- HDU4280 Island Transport【网络流】
- poj1459SAP最大流模板题
- uva820 最大流模板题
- 局域网,广域网,多文件上传下载工具
- Java——三位数的各个位之和
- WINCE系统中WINFORM的按键事件的使用方法简介
- 路由器链路聚合技术(Eth-Trunk、Ip-Trunk)
- 编程实习程序
- 【HDU4280】【最大流模板题】
- mysql实现多行查询结果合并成一行
- Redis sentinel 主从自动切换配置
- shell脚本编程:将文件中指定行的内容进行替换
- maven配置settings.xml
- 解决错误 Target runtime com.genuitec.runtime.generic.jee60 is not defined.
- CSS3 圆角(border-radius)
- X: user not authorized to run the X server, aborting
- iOS 开发之tag,视图图层间的关系