Power Network (poj 1459 网络流)
Language:
Default
Power Network
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) <= pmax(u) of power, may consume an amount
0 <= c(u) <= min(s(u),cmax(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) <= lmax(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 pmax(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 lmax(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 lmax(u,v). Follow np doublets (u)z, where u is the identifier of a power station and 0 <= z <= 10000 is the value of pmax(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 cmax(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 Sample Output 15 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 |
题意:在一个电力网中有n个节点,当中有np个发电站。nc个消耗点。剩下的为中转站,m条电缆。当中仅仅有发电站发电,每一个发电站所能发电的最大值已知。仅仅有消耗点消耗电,每一个消耗点消耗的最大值已知。中转站即不消耗也不发电。
每条电缆都有个传送电力的限制。为该网络所能消耗的最大电力。
思路:设一个源s和一个汇t,最后把源s和发电厂连接,边的容量为发电厂的容量,将用户与汇t连接,容量为用户的容量。
这是我做的第一个网络流,今天 看了一天。最终懂了一点。
代码:
//最短增广路算法(SAP)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 1005
#define MAXN 2005
#define mod 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std; int d[maxn];
int mp[maxn][maxn];
int num[maxn];
int pre[maxn];
int n,m,s,t,np,nc; void init()
{
int k;
queue<int>Q;
memset(d,INF,sizeof(d));
memset(num,0,sizeof(num));
d[t]=0;
num[0]=1;
Q.push(t);
while (!Q.empty())
{
k=Q.front();
Q.pop();
for (int i=0;i<n;i++)
{
if (d[i]>=n&&mp[i][k]>0)
{
d[i]=d[k]+1;
Q.push(i);
num[d[i]]++;
}
}
}
} int findAlowFlow(int i)
{
int j;
for (j=0;j<n;j++)
if (mp[i][j]>0&&d[i]==d[j]+1)
return j;
return -1;
} int reLable(int i)
{
int mm=INF;
for (int j=0;j<n;j++)
if (mp[i][j]>0)
mm=min(mm,d[j]+1);
return mm==INF?n:mm;
} int maxFlow(int s,int t)
{
int flow=0,i=s,j;
int delta;
memset(pre,-1,sizeof(pre));
while (d[s]<n)
{
j=findAlowFlow(i);
if (j>=0)
{
pre[j]=i;
i=j;
if (i==t)
{
delta=INF;
for (i=t;i!=s;i=pre[i])
delta=min(delta,mp[pre[i]][i]);
for (i=t;i!=s;i=pre[i])
mp[pre[i]][i]-=delta,mp[i][pre[i]]+=delta;
flow+=delta;
}
}
else
{
int x=reLable(i);
num[x]++;
num[d[i]]--;
if (num[d[i]]==0)
return flow;
d[i]=x;
if (i!=s)
i=pre[i];
}
}
return flow;
} int main()
{
while (scanf("%d%d%d%d",&n,&np,&nc,&m)!=EOF)
{
int u,v,w;
memset(mp,0,sizeof(mp));
for (int i=0;i<m;i++)
{
scanf(" (%d,%d)%d",&u,&v,&w);
mp[u][v]=w;
}
for (int i=0;i<np;i++)
{
scanf(" (%d)%d",&u,&w);
mp[n][u]=w;
}
for (int i=0;i<nc;i++)
{
scanf(" (%d)%d",&u,&w);
mp[u][n+1]=w;
}
s=n;
t=n+1;
n=n+2;
// printf("n=%d\n",n);
init();
printf("%d\n",maxFlow(s,t));
}
return 0;
}
一般增广路算法(EK)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 1005
#define MAXN 2005
#define mod 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std; bool used[maxn];
int pre[maxn];
int mp[maxn][maxn];
int n,np,nc,m; int ford()
{
int i,res=0,now,mi;
queue<int>Q;
while (1)
{
memset(pre,-1,sizeof(pre));
memset(used,0,sizeof(used));
while (!Q.empty())
Q.pop();
Q.push(0);
used[0]=true;
while (!Q.empty())
{
now=Q.front();
Q.pop();
if (now==n)
break;
for (i=0;i<=n;i++)
{
if (!used[i]&&mp[now][i]>0)
{
pre[i]=now;
used[i]=true;
Q.push(i);
}
}
}
if (!used[n])
break;
mi=INF;
for (i=n;i!=0;i=pre[i])
if (mp[pre[i]][i]<mi)
mi=mp[pre[i]][i];
res+=mi;
for (i=n;i!=0;i=pre[i])
{
mp[pre[i]][i]-=mi;
mp[i][pre[i]]+=mi;
}
}
return res;
} int main()
{
while (scanf("%d%d%d%d",&n,&np,&nc,&m)!=EOF)
{
int u,v,w;
memset(mp,0,sizeof(mp));
for (int i=0;i<m;i++)
{
scanf(" (%d,%d)%d",&u,&v,&w);
mp[u+1][v+1]=w;
}
for (int i=0;i<np;i++)
{
scanf(" (%d)%d",&u,&w);
mp[0][u+1]=w;
}
for (int i=0;i<nc;i++)
{
scanf(" (%d)%d",&u,&w);
mp[u+1][n+1]=w;
}
n=n+1;
// printf("n=%d\n",n);
printf("%d\n",ford());
}
return 0;
}
Power Network (poj 1459 网络流)的更多相关文章
- Power Network POJ - 1459 [网络流模板]
http://poj.org/problem?id=1459 嗯,网络流模板...多源点多汇点的图,超级汇点连发电厂,用户连接超级汇点 Status Accepted Time 391ms Memor ...
- Power Network POJ - 1459 网络流 DInic 模板
#include<cstring> #include<cstdio> #define FOR(i,f_start,f_end) for(int i=f_startl;i< ...
- Power Network - poj 1459 (最大流 Edmonds-Karp算法)
Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 24788 Accepted: 12922 Description A ...
- F - Power Network - poj 1459(简单最大流)
题目大意:题目说了一大堆,其实都是废话......让人有些不知所云,其实就是给了一些电厂,和一些消费点,然后里面有一些路线什么的,求出消费点可以最多消费的电量是多少. 输入大意: 分析:懂了题意就是一 ...
- F - Power Network POJ - 1459
题目链接:https://vjudge.net/contest/299467#problem/F 这个是一个很简单的题目,但是读入很有意思,通过这个题目,我学会了一种新的读入方式. 一个旧的是(%d, ...
- poj 1459 Power Network : 最大网络流 dinic算法实现
点击打开链接 Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 20903 Accepted: ...
- poj 1459 网络流问题`EK
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 24930 Accepted: 12986 D ...
- poj 1459(网络流)
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 26688 Accepted: 13874 D ...
- POJ 1459 网络流 EK算法
题意: 2 1 1 2 (0,1)20 (1,0)10 (0)15 (1)20 2 1 1 2 表示 共有2个节点,生产能量的点1个,消耗能量的点1个, 传递能量的通道2条:(0,1)20 (1,0) ...
随机推荐
- python开发_thread_线程基础
说到线程,我们要知道啥是串行,啥是并行程序 举个例子: 串行程序,就是一个一个的执行程序 #python threading import time ''' 每一秒中,输出:this is a dem ...
- CentOS 7编译openssl
# 编译安装zlib库wget http://zlib.net/zlib-1.2.11.tar.gztar -zxvf zlib-1.2.11.tar.gz cd zlib-1.2.11 ./conf ...
- 7407 74LS07 74LV07 74LVC07
SN7407 Convert TTL Voltage Levels to MOS LevelsHigh Sink-Current CapabilityInput Clamping Diodes Sim ...
- LINUX下的21个特殊符号 转
1. > 重定向输出符号. 2. >>重定向输出符号,但有追加的功能. 3. 2>错误重定向输出符号,覆盖原文件内容. 4. 2>>错误重定向输出符号, ...
- shell中的括号(小括号,中括号,大括号)及单引号、 双引号,反引号(``)
一.小括号,园括号() 1.单小括号 () ①命令组.括号中的命令将会新开一个子shell顺序执行,所以括号中的变量不能够被脚本余下的部分使用.括号中多个命令之间用分号隔开,最后一个命令可以没有分号, ...
- MVC文件上传06-使用客户端jQuery-File-Upload插件和服务端Backload组件自定义控制器上传多个文件
当需要在控制器中处理除了文件的其他表单字段,执行控制器独有的业务逻辑......等等,这时候我们可以自定义控制器. MVC文件上传相关兄弟篇: MVC文件上传01-使用jquery异步上传并客户端验证 ...
- SQL:查询学习笔记
SQL 查询命令 SELECT 语法 SELECT "column_name" FROM "table_name"; 返回一列 SELECT Username ...
- SQL Server批量替换全部表中内容sql语句-清楚挂马
有朋友常常会发现自己的数据库全部的内容给插入了一些代码,假设要一个个表一个个记录去删除.太麻烦了,以下我在在网上找到一个能够批量删除的方法,实际上是批量把那段恶意代码替换,很高速. declare @ ...
- 阿里云服务器IIS启用HTTPS协议(转)
https://www.cnblogs.com/randytech/p/7017188.html
- IOS tableview 横向滚动
1. UITableView 设置 CGRect tableViewRect = CGRectMake(0.0, 0.0, 50.0, 320.0);self.tableView = [[UITabl ...