POJ-1459 Power Network

Power Network Time Limit: 2000MS   Memory Limit: 32768K Total Submissions: 29271   Accepted: 15192 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

题意：

输入n,np,nc,m。表示有n个点，np个发电站，nc个用户，m条线路。先输入m条边，每条线路有流量上限。然后输入np个发电站，有发电上限。nc个用户，有能够接受的流量上限。

思路：

最大流。关键是构图。需要虚构一个源点和一个汇点。源点连接发电站，边容量为发电能力。汇点连接用户，边容量为用户用量。然后直接套用模板就好了。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
#define inf 1<<29
int n,np,nc,m;
int G[105][105];
int level[105];
int bfs(int s,int t)
{
    memset(level,0,sizeof level);
    queue<int> q;
    level[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int top=q.front(); q.pop();
        for(int i=0;i<=n+1;i++)
        {
            if(!level[i] && G[top][i])
            {
                level[i]=level[top]+1;
                q.push(i);
            }
        }
    }
    return level[t];
}
int dfs(int u,int t,int flow)
{
    int s=flow,increase;
    if(u==t) return flow;
    for(int i=0;i<=n+1;i++)
    {
        if(level[i]==level[u]+1 && G[u][i])
        {
            increase=dfs(i,t,min(flow,G[u][i]));
            G[u][i]-=increase;
            G[i][u]+=increase;
            flow-=increase;
        }
    }
    return s-flow;
}
int dinic(int s,int t)
{
    int ans=0;
    while(bfs(s,t)) ans+=dfs(s,t,inf);
    return ans;
}
int main()
{
    while(~scanf("%d%d%d%d",&n,&np,&nc,&m))
    {
        char str[100];
        memset(G,0,sizeof G);
        int u,v,w,point;
        for(int i=0;i<m;i++)
        {
            scanf("%s",str);
            point=strchr(str,',')-str;
            sscanf(str+1,"%d",&u);
            sscanf(str+point+1,"%d",&v);
            point=strchr(str,')')-str;
            sscanf(str+point+1,"%d",&w);
            G[u][v]+=w;
        }
        for(int i=0;i<np;i++)
        {
            scanf("%s",str);
            sscanf(str+1,"%d",&u);
            point=strchr(str,')')-str;
            sscanf(str+point+1,"%d",&w);
            G[n][u]+=w;
        }
        for(int i=0;i<nc;i++)
        {
            scanf("%s",str);
            sscanf(str+1,"%d",&u);
            point=strchr(str,')')-str;
            sscanf(str+point+1,"%d",&w);
            G[u][n+1]+=w;
        }
        printf("%d\n",dinic(n,n+1));
    }
    return 0;
}