POJ 1459 Power Network

最新推荐文章于 2016-08-19 11:55:19 发布

原创最新推荐文章于 2016-08-19 11:55:19 发布 · 550 阅读

0 ·

CC 4.0 BY-SA版权

POJ 专栏收录该内容

182 篇文章

订阅专栏

本文深入探讨了信息技术领域的核心内容，包括但不限于前端开发、后端开发、移动开发、游戏开发、大数据开发、开发工具、嵌入式硬件、嵌入式电路知识、嵌入式开发环境、音视频基础、音视频直播流媒体、图像处理AR特效、AI音视频处理、测试、基础运维、DevOps、操作系统、云计算厂商、自然语言处理、区块链、隐私计算、文档协作与知识管理、版本控制、项目管理与协作工具、有监督学习、无监督学习、半监督学习、强化学习、数据安全、数据挖掘、数据结构、算法等。文章旨在为读者提供一个全面而深入的知识体系，帮助理解和掌握信息技术领域的关键知识点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Power Network

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 19156		Accepted: 10107

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

[Submit] [Go Back] [Status] [Discuss]

这道题目看起来很麻烦，看题目的叙述我晕了，其实这就是一个建图的题目，把图建好用最大流就行了

建图：建立一个超级源点链接发电站，超级汇点链接用户就好了，在用最大流就好了

#include <iostream>
#include <string.h>
using namespace std;
int pre[500],queue[1000000];
int a[500][500],b[500][500];
string s1;
int sta,end;
int INF=0x7ffffff;
int main()
{
    int EK();
    int i,j,s,t,x,y,val,k;
    int n,np,nc,m;
    char c;
    while(cin>>n>>np>>nc>>m)
    {
        memset(a,0,sizeof(a));
        sta=0; end=n+1;
        for(i=1;i<=m;i++)
        {
            cin>>c>>x>>c>>y>>c>>val;
            a[x+1][y+1]=val;
        }
        for(i=1;i<=np;i++)
        {
            cin>>c>>x>>c>>val;
            a[0][x+1]=val;
        }
        for(i=1;i<=nc;i++)
        {
            cin>>c>>x>>c>>val;
            a[x+1][end]=val;
        }
        k=0;
        k=EK();
        cout<<k<<endl;
    }
    return 0;
}
int bfs()
{
    int i,j,base,top,x;
    int min1[1000];
    base=top=0;
    memset(pre,-1,sizeof(pre));
    queue[top++]=sta;
    pre[sta]=-2;
    min1[sta]=INF;
    while(base<top)
    {
        x=queue[base++];
        for(i=1;i<=end;i++)
        {
            if(pre[i]==-1&&a[x][i])
            {
                min1[i]=min1[x]<a[x][i]? min1[x]:a[x][i];
                pre[i]=x;
                queue[top++]=i;
                if(i==end)
                {
                    break;
                }
            }
        }
        if(i!=end+1)
        {
            break;
        }
    }
    if(pre[end]==-1)
    {
        return -1;
    }
    return min1[end];
}
int EK()
{
    int i,j,s=0,k,t,pre_x;
    while(1)
    {
        k=bfs();
        if(k==-1)
        {
            break;
        }
        s+=k;
        for(t=end;t!=sta;t=pre[t])
        {
            pre_x=pre[t];
            a[pre_x][t]-=k;
            a[t][pre_x]+=k;
        }
    }
    return s;
}