Power Network poj1459 最大流

Description

---

有一个供电网络，一些点能提供电力，一些点要消耗电力，还有一些不耗电的输电线，求最大总耗电

Solution

---

输入格式扯淡

我果然还是太弱了，英语题目都看不懂啊。把供电站和耗电站(暂且这么叫)分别向源点和汇点连边，容量就是给出的w，这么做就限制了发电量和用电量了，最大流

md加一个当前弧优化快1500MS

Code

---

#include <stdio.h>
#include <string.h>
#include <queue>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define INF 0x3f3f3f3f
#define N 2001
#define E N * 20 + 1
struct edge{int x, y, w, next;}e[E];
int ls[N];
inline void addEdge(int &cnt, int x, int y, int w){
    cnt += 1; e[cnt] = (edge){x, y, w, ls[x]}; ls[x] = cnt;
    cnt += 1; e[cnt] = (edge){y, x, 0, ls[y]}; ls[y] = cnt;
}
using std:: queue;
int dis[N];
inline int bfs(int st, int ed){
    queue<int> que;
    que.push(st);
    fill(dis, -1);
    dis[st] = 1;
    while (!que.empty()){
        int now = que.front(); que.pop();
        erg(i, now){
            if (e[i].w > 0 && dis[e[i].y] == -1){
                dis[e[i].y] = dis[now] + 1;
                que.push(e[i].y);
                if (e[i].y == ed){
                    return 1;
                }
            }
        }
    }
    return 0;
}
inline int min(int x, int y){
    return x<y?x:y;
}
int cur[N];
inline int find(int now, int ed, int mn){
    if (now == ed || !mn){
        return mn;
    }
    int ret = 0;
    for (int &i = cur[now]; i; i = e[i].next){
        if (e[i].w > 0 && dis[now] + 1 == dis[e[i].y]){
            int d = find(e[i].y, ed, min(mn - ret, e[i].w));
            e[i].w -= d;
            e[i ^ 1].w += d;
            ret += d;
            if (mn == ret){
                break;
            }
        }
    }
    return ret;
}
inline int dinic(int st, int ed){
    int tot = 0;
    while (bfs(st, ed)){
        rep(i, st, ed){
            cur[i] = ls[i];
        }
        tot += find(st, ed, INF);
    }
    return tot;
}
int main(void){
    int n, np, nc, m;
    while (~scanf("%d%d%d%d", &n, &np, &nc, &m)){
        int edgeCnt = 1;
        fill(ls, 0);
        rep(i, 1, m){
            int x, y, w;
            scanf(" (%d,%d)%d", &x, &y, &w);
            // printf("%d %d %d\n", x, y, w);
            addEdge(edgeCnt, x + 1, y + 1, w);
        }
        int st = 0;
        rep(i, 1, np){
            int x, w;
            scanf(" (%d)%d", &x, &w);
            // printf("%d %d\n", x, w);
            addEdge(edgeCnt, st, x + 1, w);
        }
        int ed = n + 1 + 1;
        rep(i, 1, nc){
            int x, w;
            scanf(" (%d)%d", &x, &w);
            // printf("%d %d\n", x, w);
            addEdge(edgeCnt, x + 1, ed, w);
        }
        int ans = dinic(st, ed);
        printf("%d\n", ans);
    }
    return 0;
}