poj1459 Power Network

Power NetworkTime limit:2000MS Memory Limit:32768KB 64bit IO Format :%i64d &%i64u

Description

A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node U is supplied with an amount s (U) >= 0 of the power, may produce an amount 0 <= P (u) <= P max (U) of power, May consume a 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 PO Wer. The following restrictions Apply:c (U) =0 for any power station, p (U) =0 for all consumer, and P (u) =c (u) =0 for any Dispatche R. 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) <= Lmax (u,v) of the Power delivered by U v. Let Con=σuc (U) is the power consumed in the net. The problem is to compute the maximum value of Con.

An example was 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 Cmax (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 is other possible states of the network but the value of Con cannot exceed 6.

Input

There is several data sets in the input. Each data set encodes a power network. It starts with four integers:0 <= n <= (nodes), 0 <= NP <= N (power stations), 0 <= NC <= N (consum ERS), 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 <= 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 are the identifier of a consumer and 0 <= Z <= 10000 is the value of C Max (U). All input numbers is integers. Except the (u,v) z Triplets and the (U) z doublets, which do not contain white spaces, white spaces can occur freely in Inpu T. Input data terminate with an end of file and is correct.

Output

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

Sample Input

2 1 1 2 (0,1) (1,0) ten (0) (1) 207 2 3 (0,0) 1 (0,1) 2 (0,2) 5 (1,0) 1 (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

156

Hint

The sample input contains the 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 p Ower 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. A typical multi-source multi-sink maximum flow problem, just find another source point, a meeting point can be.

#include <stdio.h>#include<queue>#include<string.h>#defineMAXN 1000#defineINF 1<<28intCAP[MAXN][MAXN], VIS[MAXN], PRE[MAXN], MAXFLOW[MAXN];using namespacestd;intN, Npow, Ncon, M;voidBFs () {Queue<int>Q; intI, Maxflow, u, v; Maxflow=0;  while(1) {memset (Vis,0,sizeof(VIS)); memset (PRE,0,sizeof(pre)); memset (Maxflow,0,sizeof(Maxflow)); Maxflow[n]=INF;        Q.push (n); Vis[n]=1;  while(!Q.empty ()) {u=Q.front ();            Q.pop ();  for(v=0; v<=n+1; v++){                if(!vis[v] && cap[u][v]>0) {Vis[v]=1; PRE[V]=u;                    Q.push (v); MAXFLOW[V]= Maxflow[u]<cap[u][v]?Maxflow[u]:cap[u][v]; }            }        }        if(!maxflow[n+1]) Break;  for(i=n+1; I!=n; I=Pre[i]) {Cap[pre[i]][i]-= maxflow[n+1]; Cap[i][pre[i]]+ = maxflow[n+1]; } Maxflow+ = maxflow[n+1]; } printf ("%d\n", Maxflow);}intMain () {inti, U, V, c;  while(~SCANF ("%d %d%d%d", &n, &npow, &ncon, &m) {memset (cap,0,sizeof(CAP));  for(i=0; i<m; i++) {scanf ("(%d,%d)", &u, &v); scanf ("%d", &c); CAP[U][V]+=C; }          for(i=0; i<npow; i++) {scanf ("(%d)", &u); scanf ("%d", &c); Cap[n][u]+=C; }          for(i=0; i<ncon; i++) {scanf ("(%d)", &v); scanf ("%d", &c); Cap[v][n+1] +=C;     } BFS (); }     return 0;}

View Code