题目连接
题意:
N,Np,Nc,M
N代表结点数量,M代表边的数量,Np代表结点中电站的数量(只产电,不耗电),Nc代表消费者数量(只耗电,不产电),其他结点代表中转站(不产电,不耗电)
M组(u,v)w数据,代表u到v容量为w,接着Np组(u)w,代表结点u产电w,接着Nc组(u)w,代表结点u耗电w。
求电网中能消耗的最大电能值。
思路:
1)求最大流
2)源点到产电站的容量看成产电量,消费者到汇点的容量看作消费者的耗电量,直接求流入汇点的最大流
AC:代码
#include<iostream>
#include<cstring>
#include<math.h>
#include<algorithm>
#include<queue>
#include<stdio.h>
using namespace std;
const int maxn = 700;
const int maxm = 1e5;
const int inf = 0x3f3f3f3f;
int N, Nc, Np, M;
int s, e;
struct ac{
int v, c, nex;
}edge[maxm];
int head[maxn], dis[maxn], curedge[maxn], cnt;
void init() {
cnt = 0;
memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int c) {
// 正向建边
edge[cnt] = {v, c, head[u]};
head[u] = cnt++;
// 反向建边, 流量为0
edge[cnt] = {u, 0, head[v]};
head[v] = cnt++;
}
bool bfs() {
queue<int> que;
que.push(s);
memset(dis, 0, sizeof(dis)); // 对图进行分层
dis[s] = 1;
while (!que.empty()) {
int u = que.front();
que.pop();
for (int i = head[u]; i != -1; i = edge[i].nex) {
int v = edge[i].v;
int c = edge[i].c;
// 如果节点v已经分过层或者u->v流量为0, continue
if (dis[v] || c == 0) continue;
dis[v] = dis[u] + 1; // 对v进行标记并加入队列
que.push(v);
}
}
return dis[e] > 0; // 判断是否存在增广路,s是否能到达e
}
int dfs(int u, int flow) { // 增广路走到u点的最小流量为flow
if (u == e || flow == 0) return flow;
// 遍历u的所有出边
for (int &i = curedge[u]; i != -1; i = edge[i].nex) { // 当前弧优化
int v = edge[i].v;
int c = edge[i].c;
// 判断能否u->v增广
if (dis[v] != dis[u] + 1 || c == 0) continue;
int d = dfs(v, min(flow, c));
if (d > 0) { // 找到一条增广路,修改增广路上的正反向边
edge[i].c -= d;
edge[i^1].c += d;
return d;
}
}
dis[u] = -1; // // 炸点优化
return 0;
}
int Dinic() {
int sum = 0, d;
while (bfs()) { // 判读是否存在增广路
for (int i = 0; i <= e; ++i) curedge[i] = head[i]; // copy head数组,在dfs中可以直接得到下一条没有被增广过的边
while ((d = dfs(s, inf)) > 0) sum += d; // 多次dfs找增广路
}
return sum;
}
int main () {
int u, v, c;
while (scanf("%d%d%d%d", &N, &Np, &Nc, &M) != EOF) {
init();
char ss[50];
s = N + 1;
e = N + 2;
for (int i = 0; i < M; ++i) {
scanf("%s", ss);
sscanf(ss, "(%d,%d)%d", &u, &v, &c);
addedge(u, v, c);
}
for (int i = 0; i < Np; ++i) {
scanf("%s", ss);
sscanf(ss, "(%d)%d", &v, &c);
addedge(s, v, c);
}
for(int i = 0; i < Nc; ++i){
scanf("%s", ss);
sscanf(ss, "(%d)%d", &u, &c);
addedge(u, e, c);
}
printf("%d\n", Dinic());
}
return 0;
}