HDU 4280 ISAP+BFS 最大流 模板
2017-10-02 17:58
429 查看
Island Transport
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 9473 Accepted Submission(s): 3069
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output an integer in one line, the transport capacity.
[align=left]Sample Input[/align]
2
5 7
3 3
3 0
3 1
0 0
4 5
1 3 3
2 3 4
2 4 3
1 5 6
4 5 3
1 4 4
3 4 2
6 7
-1 -1
0 1
0 2
1 0
1 1
2 3
1 2 1
2 3 6
4 5 5
5 6 3
1 4 6
2 5 5
3 6 4
[align=left]Sample Output[/align]
9
6
最大流裸题 *可用模板
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<map> using namespace std; #define ll long long const int M = 100010; const int INF = 0x3f3f3f3f; struct Edge{ int to,next,cap,flow; }edge[4*M]; int tol; int head[M]; int gap[M],dep[M],cur[M]; void init() { tol=0; memset(head,-1,sizeof(head)); } void addedge(int u,int v,int w){ int rw=0; edge[tol].to=v;edge[tol].cap=w;edge[tol].flow=0; edge[tol].next=head[u];head[u]=tol++; edge[tol].to=u;edge[tol].cap=rw;edge[tol].flow=0; edge[tol].next=head[v];head[v]=tol++; } int Q[M]; void bfs(int start,int end){ memset(dep,-1,sizeof(dep)); memset(gap,0,sizeof(gap)); gap[0]=1; int front=0,rear=0; dep[end]=0; Q[rear++]=end; while(front !=rear){ int u=Q[front++]; for(int i=head[u];i!=-1;i=edge[i].next){ int v=edge[i].to; if(dep[v]!=-1) continue; Q[rear++]=v; dep[v]=dep[u]+1; gap[dep[v]]++; } } } int S[M]; int sap(int start,int end,int N){ bfs(start,end); memcpy(cur,head,sizeof(head)); int top=0; int u=start; int ans=0; while(dep[start]<N){ if(u==end){ int Min=INF; int inser; for(int i=0;i<top;i++){ if(Min>edge[S[i]].cap-edge[S[i]].flow){ Min=edge[S[i]].cap-edge[S[i]].flow; inser=i; } } for(int i=0;i<top;i++){ edge[S[i]].flow+=Min; edge[S[i]^1].flow-=Min; } ans+=Min; top=inser; u=edge[S[top]^1].to; continue; } bool flag=false; int v; for(int i=cur[u];i!=-1;i=edge[i].next){ v=edge[i].to; if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u]){ flag=true; cur[u]=i; break; } } if(flag){ S[top++] = cur[u]; u=v; continue; } int Min=N; for(int i=head[u];i!=-1;i=edge[i].next){ if(edge[i].cap-edge[i].flow&&dep[edge[i].to]<Min){ Min=dep[edge[i].to]; cur[u]=i; } } gap[dep[u]]--; if(!gap[dep[u]]) return ans; dep[u]=Min+1; gap[dep[u]]++; if(u!=start) u=edge[S[--top]^1].to; } return ans; } int t; int n,m; int main() { scanf("%d",&t); while(t--){ init(); scanf("%d %d",&n,&m); int minx=10000000; int maxx=-10000000; int start,tail; for(int i=1;i<=n;i++){ int x,y; scanf("%d %d",&x,&y); if(x<minx){minx=x;start=i;} else if(x>maxx){maxx=x;tail=i;} } for(int i=1;i<=m;i++){ int qq,w,e; scanf("%d %d %d",&qq,&w,&e); addedge(qq,w,e); addedge(w,qq,e); } printf("%d\n",sap(start,tail,n)); } return 0; }
相关文章推荐
- hdu 1532 Drainage Ditches(最大流 三种模板:EK、Dinic、isap)
- Island Transport HDU - 4280 最大流 ISAP
- 文章标题 HDU 4280 :Island Transport (最大流--ISAP)
- HDU 4289 - Control(最大流-ISAP模板)
- hdu 4280 最大流isap
- Hdu 4280 最大流<模板>.cpp
- hdu 3374 next表,最大最小表示法模板
- HDU_1532 && HDU_3549(最大流EK算法模板)
- 最大流 isap 模板
- HDU 3374 String Problem(最大最小表示法模板+KMP+next数组的运用)
- Battle (hdu 3061 最大权闭合图模板题)
- Knight Moves(hdu1372 bfs模板题)
- 【最大流之sap】【HDU1532】模板题
- HDU 1754 B I Hate It 线段树 单点更新 区间最大值 模板
- HDU 4280 Island Transport(裸最大流)
- hdu 3549 网络流模板(dinic + ISAP)
- hdu 4687 带花树求一般图最大匹配(模板)
- HDU 1532 Drainage Ditches(增广路dfs&bfs模板)
- HDU 2063 过山车 【二分图最大匹配(匈牙利模板)】
- hdu 3572 最大流isap模版 邻接表写。。