Island Transport
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.
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.
Output
For each test case, output an integer in one line, the transport capacity.
Sample Input
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
Sample Output
9
6
该题是最大流裸体，数据范围很大，可以用dinic但要注意数组要开的够大，且必须要当前弧优化，且最好不用STL（别用queue），方能把时间卡进去（反正我交了一次9400ms左右..）
因为是双向边， 相当于无向图，且题目保证无重边，可以不用每条边再加一个cap为0的残边，
不知把BFS写进主函数会不会节省些时间
1 #include <iostream> 2 #include <cstdio> 3 #include <string.h> 4 #include <algorithm> 5 #define MIN(x,y) ((x)>(y))?(y):(x) 6 #define MAX(x,y) ((x)>(y))?(x):(y) 7 8 using namespace std; 9 10 const int inf = 0x3f3f3f3f; 11 const int ninf = 0xc0c0c0c0; //无穷小 12 const int vspot = 200010; 13 const int espot = 401000; 14 15 struct Edges{ 16 int to, next, cap; 17 }edges[vspot]; 18 19 int V, E, cnt; 20 int S, T, ans; 21 int linjie[vspot], dist[vspot], cur[vspot]; 22 int Q[espot]; 23 24 void addEdges( int from, int to, int cap ) 25 { 26 edges[cnt].to = to; 27 edges[cnt].cap = cap; 28 edges[cnt].next = linjie[from]; 29 linjie[from] = cnt++; 30 31 edges[cnt].to = from; 32 edges[cnt].cap = cap; 33 edges[cnt].next = linjie[to]; 34 linjie[to] = cnt++; //直接加两条边就行 35 } 36 37 int BFS() 38 { 39 memset( dist, -1, sizeof(dist) ); 40 int run, head = 0, rear = 1; 41 42 Q[head] = S; 43 dist[S] = 0; 44 45 while(head<rear) 46 { 47 run = Q[head++]; 48 for( int i = linjie[run]; i+1; i = edges[i].next ) 49 { 50 int v = edges[i].to, flow = edges[i].cap; 51 if( dist[v] < 0 && flow > 0 ) 52 { 53 dist[v] = dist[run] + 1; 54 Q[rear++] = v; 55 } 56 } 57 } 58 59 if( dist[T] > 0 ) 60 return 1; 61 else 62 return 0; 63 } 64 65 int find( int s, int low ) 66 { 67 int ff = 0; 68 if( s == T ) 69 return low; 70 for( int& i = cur[s]; i+1; i = edges[i].next ) //注意int& i = cur[s] 当前弧优化 71 { 72 int v = edges[i].to, cap = edges[i].cap; 73 if( cap > 0 74 && dist[v] == dist[s] + 1 75 && (ff = find(v,MIN(cap,low))) ) 76 { 77 edges[i].cap -= ff; 78 edges[i^1].cap += ff; 79 return ff; 80 } 81 } 82 return 0; 83 } 84 85 void dinic() 86 { 87 ans = 0; 88 int tans; 89 while(BFS()) 90 { 91 for( int i = 1; i <= V; i++ ) //当前弧优化 92 cur[i] = linjie[i]; 93 while( tans = find(S,inf) ) 94 ans += tans; 95 } 96 } 97 98 int main() 99 { 100 int N; 101 cin >> N; 102 while( N-- ) 103 { 104 scanf( "%d %d", &V, &E ); 105 cnt = 0; 106 memset( linjie, -1, sizeof(linjie) ); 107 108 int x, y, val, x2 = ninf, x1 = inf; 109 for( int i = 1; i <= V; i++ ) 110 { 111 scanf( "%d %d", &x, &y ); 112 if( x < x1 ) 113 { 114 x1 = x; 115 S = i; 116 } 117 118 if( x > x2 ) 119 { 120 x2 = x; 121 T = i; 122 } 123 } 124 125 for( int i = 1; i <= E; i++ ) 126 { 127 scanf( "%d %d %d", &x, &y, &val ); 128 addEdges(x,y,val); 129 } 130 ///////////////////////////////////////////////////////////////// 131 dinic(); 132 cout << ans << endl; 133 } 134 135 return 0; 136 }