poj 1459 最大流算法（Dinic算法与Ford-Fulkerson算法）

Power Network

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 21178		Accepted: 11091

Description

A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <= p(u) <= p _max(u) of power, may consume an amount 0 <= c(u) <= min(s(u),c _max(u)) of power, and may deliver an amount d(u)=s(u)+p(u)-c(u) of power. The following restrictions apply: c(u)=0 for any power station, p(u)=0 for any consumer, and p(u)=c(u)=0 for any dispatcher. There is at most one power transport line (u,v) from a node u to a node v in the net; it transports an amount 0 <= l(u,v) <= l _max(u,v) of power delivered by u to v. Let Con=Σ _uc(u) be the power consumed in the net. The problem is to compute the maximum value of Con.

An example is in figure 1. The label x/y of power station u shows that p(u)=x and p _max(u)=y. The label x/y of consumer u shows that c(u)=x and c _max(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and l _max(u,v)=y. The power consumed is Con=6. Notice that there are other possible states of the network but the value of Con cannot exceed 6.

Input

There are several data sets in the input. Each data set encodes a power network. It starts with four integers: 0 <= n <= 100 (nodes), 0 <= np <= n (power stations), 0 <= nc <= n (consumers), and 0 <= m <= n^2 (power transport lines). Follow m data triplets (u,v)z, where u and v are node identifiers (starting from 0) and 0 <= z <= 1000 is the value of l _max(u,v). Follow np doublets (u)z, where u is the identifier of a power station and 0 <= z <= 10000 is the value of p _max(u). The data set ends with nc doublets (u)z, where u is the identifier of a consumer and 0 <= z <= 10000 is the value of c _max(u). All input numbers are integers. Except the (u,v)z triplets and the (u)z doublets, which do not contain white spaces, white spaces can occur freely in input. Input data terminate with an end of file and are correct.

Output

For each data set from the input, the program prints on the standard output the maximum amount of power that can be consumed in the corresponding network. Each result has an integral value and is printed from the beginning of a separate line.

Sample Input

2 1 1 2 (0,1)20 (1,0)10 (0)15 (1)20
7 2 3 13 (0,0)1 (0,1)2 (0,2)5 (1,0)1 (1,2)8 (2,3)1 (2,4)7
         (3,5)2 (3,6)5 (4,2)7 (4,3)5 (4,5)1 (6,0)5
         (0)5 (1)2 (3)2 (4)1 (5)4

Sample Output

15
6

Hint

The sample input contains two data sets. The first data set encodes a network with 2 nodes, power station 0 with pmax(0)=15 and consumer 1 with cmax(1)=20, and 2 power transport lines with lmax(0,1)=20 and lmax(1,0)=10. The maximum value of Con is 15. The second data set encodes the network from figure 1.

Source

Southeastern Europe 2003


这道题很容易想出是最大流问题。
需要注意的是数据预处理部分，结点的编号是[0, n-1] 因此，我们设置新的源点编号为n， 指向所有的发电站。再设定新的汇点编号为n+1，所有的消费者点都指向它。这个问题就转化为了单源单汇最大流问题。
第一次试了Ford-Fulkerson算法（ 复杂度是O(F|E|))。这个算法的问题是当最大流F的取值很大时（本题可能为数万甚至几十万），可能会tle。
因此改用更快的Dinic算法（ O(|E||V|^2)) 就ac了。

提交记录：
1.TLE
2.改用Dinic算法后AC


下面将两种算法的代码都粘贴上来：
TLE的Ford-Fulkerson算法：

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          #include 
         
           #define MAX_V 500 #define oo 0x3f3f3f3f using namespace std; struct edge {int to, cap, rev;}; vector 
          
            G[MAX_V]; bool used[MAX_V]; void add_edge(int from, int to, int cap) { G[from].push_back((edge){to, cap, G[to].size()}); G[to].push_back((edge){from, 0, G[from].size()-1}); } int dfs(int v, int t, int f) { if (v == t) return f; used[v] = true; int i; for (i = 0; i < G[v].size(); i++) { edge &e = G[v][i]; if (!used[e.to] && e.cap > 0) { int d = dfs(e.to, t, min(f, e.cap)); if (d>0) { // 找到一条增广流量 e.cap -= d; G[e.to][e.rev].cap += d; return d; } } } return 0; } int max_flow(int s, int t) { int flow = 0; for(;;) { memset(used, 0, sizeof(used)); int f = dfs(s, t, oo); if (f == 0) return flow; flow += f; } } int main() { int n, np, nc, m; //while (cin >> n >> np >> nc >> m) { while (EOF != scanf("%d%d%d%d", &n, &np, &nc, &m)) { int i, j; int u, v, z; char tmp; for (i = 0; i < MAX_V; i++) G[i].clear(); for (i = 0; i < m; i++) { //while (cin >> tmp && tmp != '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d%c%d", &u, &tmp, &v, &tmp, &z); //cin >> u >> tmp >> v >> tmp >> z; add_edge(u, v, z); } for(i = 0; i < np; i++) { //while (cin >> tmp && tmp!= '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d", &u, &tmp, &z); //cin >> u >> tmp >> z; add_edge(n, u, z);//n号是源点 } for (i = 0; i < nc; i++) { //while (cin >> tmp && tmp!= '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d", &u, &tmp, &z); //cin >> u >> tmp >> z; add_edge(u, n+1, z); //n+1号点是汇点 } //cout << max_flow(n, n+1) << endl; printf("%d\n", max_flow(n, n+1)); } return 0; } 
           
          
         
       
      
      
     
     
    
    
   
   

Dinic算法：

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          #include 
         
           #define MAX_V 500 #define oo 0x3f3f3f3f using namespace std; struct edge {int to, cap, rev;}; vector 
          
            G[MAX_V]; int level[MAX_V];//顶点到源点的距离编号 int iter[MAX_V];//当前弧，在其之前的边不用再考虑 void add_edge(int from, int to, int cap) { G[from].push_back((edge){to, cap, G[to].size()}); G[to].push_back((edge){from, 0, G[from].size()-1}); } //bfs用来计算从源点出发所有点的距离编号 void bfs(int s) { memset(level, -1, sizeof(level)); queue 
           
             que; level[s] = 0; que.push(s); while(!que.empty()) { int v = que.front(); que.pop(); for (int i = 0; i < G[v].size(); i++) { edge &e = G[v][i]; if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[v] + 1; que.push(e.to); } } } } //通过DFS寻找当前的最短的增广路 int dfs(int v, int t, int f) { if (v == t) return f; for (int &i = iter[v]; i < G[v].size(); i++) {//这里用引用，巧妙地修改了iter数组 edge &e = G[v][i]; if (e.cap > 0 && level[v] < level[e.to]) {//level[v] < level[e.to]这个条件保证了当前的增广路是最短的 int d = dfs(e.to, t, min(f, e.cap)); if (d > 0) { e.cap-=d; G[e.to][e.rev].cap += d; return d; } } } return 0; } int max_flow(int s, int t) { int flow = 0; for(;;) { bfs(s); if (level[t] < 0) return flow; memset(iter, 0, sizeof(iter)); int f; while (( f = dfs(s, t, oo)) > 0) { flow += f; } } } int main() { int n, np, nc, m; //while (cin >> n >> np >> nc >> m) { while (EOF != scanf("%d%d%d%d", &n, &np, &nc, &m)) { int i, j; int u, v, z; char tmp; for (i = 0; i < MAX_V; i++) G[i].clear(); for (i = 0; i < m; i++) { //while (cin >> tmp && tmp != '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d%c%d", &u, &tmp, &v, &tmp, &z); //cin >> u >> tmp >> v >> tmp >> z; add_edge(u, v, z); } for(i = 0; i < np; i++) { //while (cin >> tmp && tmp!= '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d", &u, &tmp, &z); //cin >> u >> tmp >> z; add_edge(n, u, z);//n号是源点 } for (i = 0; i < nc; i++) { //while (cin >> tmp && tmp!= '(') { while (EOF != scanf("%c", &tmp) && tmp != '(') { } scanf("%d%c%d", &u, &tmp, &z); //cin >> u >> tmp >> z; add_edge(u, n+1, z); //n+1号点是汇点 } //cout << max_flow(n, n+1) << endl; printf("%d\n", max_flow(n, n+1)); } return 0; }