【最大流】POJ-1459 Power Network
2014-09-19 14:54
363 查看
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
Sample Output
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.
————————————————————没午休的分割线————————————————————
思路:网络流水题,图全给你了。。。直接Dinic走起。
代码如下:
Time Limit: 2000MS | Memory Limit: 32768K | |
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 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.
————————————————————没午休的分割线————————————————————
思路:网络流水题,图全给你了。。。直接Dinic走起。
代码如下:
/* ID: j.sure.1 PROG: LANG: C++ */ /****************************************/ #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <cmath> #include <stack> #include <queue> #include <vector> #include <map> #include <string> #include <climits> #include <iostream> #define INF 0x3f3f3f3f using namespace std; /****************************************/ const int N = 111, M = 22222; int n, np, nc, m; struct Node { int u, v, cap; int next; }edge[M]; int tot, head , lev , cur , q , s , S, T; void init() { tot = 0; memset(head, -1, sizeof(head)); } void add(int u, int v, int c) { edge[tot].u = u; edge[tot].v = v; edge[tot].cap = c; edge[tot].next = head[u]; head[u] = tot++; } bool bfs() { memset(lev, -1, sizeof(lev)); int fron = 0, rear = 0; q[rear++] = S; lev[S] = 0; while(fron < rear) { int u = q[fron%N]; fron++; for(int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; if(edge[i].cap && lev[v] == -1) { lev[v] = lev[u] + 1; q[rear%N] = v; rear++; if(v == T) return true; } } } return false; } int Dinic() { int ret = 0; while(bfs()) { memcpy(cur, head, sizeof(head)); int u = S, top = 0; while(1) { if(u == T) { int mini = INF, loc; for(int i = 0; i < top; i++) { if(mini > edge[s[i]].cap) { mini = edge[s[i]].cap; loc = i; } } for(int i = 0; i < top; i++) { edge[s[i]].cap -= mini; edge[s[i]^1].cap += mini; } ret += mini; top = loc;//回溯 u = edge[s[top]].u; } int &i = cur[u]; for(; i != -1; i = edge[i].next) { int v = edge[i].v; if(edge[i].cap && lev[v] == lev[u] + 1) break; }//寻找允许弧 if(i != -1) { s[top++] = i; u = edge[i].v; }//入栈并更新u else { if(!top) break; lev[u] = -1; u = edge[s[--top]].u; }//出栈并更新u } } return ret; } int main() { #ifdef J_Sure // freopen("000.in", "r", stdin); // freopen(".out", "w", stdout); #endif while(~scanf("%d%d%d%d", &n, &np, &nc, &m)) { S = n+1; T = n+2; int u, v, c; init(); for(int i = 0; i < m; i++) { scanf(" (%d,%d)%d", &u, &v, &c); add(u, v, c); add(v, u, 0); } for(int i = 0; i < np; i++) { scanf(" (%d)%d", &u, &c); add(S, u, c); add(u, S, 0); } for(int i = 0; i < nc; i++) { scanf(" (%d)%d", &u, &c); add(u, T, c); add(T, u, 0); } printf("%d\n", Dinic()); } return 0; }
相关文章推荐
- poj_1459 Power Network(多源多匯最大流)
- POJ-1459 Power Network【最大流】
- poj 1459 Power Network 最大流
- POJ 1459 Power Network 最大流水题
- POJ 1459 Power Network(网络最大流,dinic算法模板题)
- POJ 1459 Power Network / HIT 1228 Power Network / UVAlive 2760 Power Network / ZOJ 1734 Power Network / FZU 1161 (网络流,最大流)
- POJ 1459 Power Network(最大流)
- poj 1459 Power Network 多源多汇最大流
- POJ 1459 Power Network(最大流)
- poj 1459 Power Network(最大流)
- POJ 1459 Power Network (最大流)
- POJ 1459 Power Network(最大流)
- POJ - 1459 Power Network(网络流最大流)
- [POJ 1459]Power Network[最大流]
- poj1459 Power Network --- 最大流 EK/dinic
- poj1459 Power Network (最大流)
- POJ 1459 && ZOJ 1734--Power Network【最大流dinic】
- Poj 1459 Power Network 最大流
- POJ1459--Power Network(最大流)
- POJ-1459 Power Network (最大流[Ford-Fulkerson])