POJ 1459 Power Network 网络流

题目源：https://vjudge.net/problem/POJ-1459

http://poj.org/problem?id=1459

模板源：https://blog.csdn.net/Adolphrocs/article/details/84368661

https://blog.csdn.net/Adolphrocs/article/details/84779691

https://blog.csdn.net/Adolphrocs/article/details/84779575

题解：网络流，dipatcher 传输站连边，源点和power station连一条边，consumer和汇点连一条边做一遍网络流

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=205;
const int maxx=200005;
int edge;
int to[maxx], flow[maxx], nex[maxx];
int head[maxn];
int n, np, nc, m;
void addEdge(int v, int u, int cap){
    to[edge] = u, flow[edge] = cap, nex[edge] = head[v], head[v] = edge++;
    to[edge] = v, flow[edge] = 0, nex[edge] = head[u], head[u] = edge++;
}
int vis[maxn];
int pre[maxn];
bool bfs(int s,int e) {
    queue<int> que;
    pre[s] = -1;
    memset(vis, -1, sizeof(vis));
    que.push(s);
    vis[s] = 0;
    while(!que.empty()) {
        int u = que.front();
        que.pop();
        for(int i = head[u]; ~i; i = nex[i]) {
            int v = to[i];
            if(vis[v] == -1 && flow[i]) {
                vis[v] = vis[u] + 1;
                if(v == e)
                    return true;
                que.push(v);
            }
        }
    }
    return false;
}
int dfs(int s, int t, int f){
    if(s == t || !f)
        return f;
    int r = 0;
    for(int i = head[s]; ~i; i = nex[i]) {
        int v = to[i];
        if(vis[v] == vis[s] + 1 && flow[i]) {
            int d = dfs(v, t, min(f, flow[i]));
            if(d > 0) {
                flow[i] -= d;
                flow[i ^ 1] += d;
                r += d;
                f -= d;
                if(!f)
                    break;
            }
        }
    }
    if(!r)
        vis[s] = INF;
    return r;
}

int maxFlow(int s, int e) {//然后直接调用这个即可
    int ans = 0;
    while(bfs(s, e))
        ans += dfs(s, e, INF);
    return ans;
}

void init() {//记得每次使用前初始化
    memset(head, -1, sizeof(head));
    edge = 0;
}

int main() {
    while(~scanf("%d%d%d%d", &n, &np, &nc, &m)) {//n作为源点，n+1作为汇点
        init();
        int ai, bi, ci;
        for(int i = 0; i < m; i++) { //ai到bi最大传输量为ci
            while(getchar() != '(');
            scanf("%d%*c%d%*c%d", &ai, &bi, &ci);
            addEdge(ai, bi, ci);
        }
        for(int i = 0; i < np; i++) {//ai最大发电量为bi
            while(getchar() != '(');
            scanf("%d%*c%d", &ai, &bi);
            addEdge(n, ai, bi);
        }
        for(int i = 0; i < nc; i++) {//ai最大消耗量为bi
            while(getchar() != '(');
            scanf("%d%*c%d", &ai, &bi);
            addEdge(ai, n + 1, bi);
        }
        printf("%d\n", maxFlow(n, n + 1));
    }
    return 0;
}

SAP+GAP邻接表

#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 5010;
const int MAXM = 200005;
const int MAXN_INT = (1 << 29);

struct Edge{
    int v, w, nxt;
};

bool isFind;
int head[MAXN];
Edge edge[MAXM];
int dis[MAXN], gap[MAXN];
int ecnt, aug, maxFlow;
int n, np, nc, m;

void init(){
    ecnt = maxFlow = 0;
    memset(gap, 0, sizeof(gap));
    memset(dis, 0, sizeof(dis));
    memset(edge, 0, sizeof(edge));
    memset(head, -1, sizeof(head));
    gap[0] = n + 2;
}

void addEdge(int u, int v, int w){
    edge[ecnt].v = v;
    edge[ecnt].w = w;
    edge[ecnt].nxt = head[u];
    head[u] = ecnt++;
}

void Find(int s){
    int dx, augc, minDis;
    if(s == n){
        isFind = true;
        maxFlow += aug;
        return;
    }

    augc = aug;
    minDis = n - 1;
    for(int i = head[s]; i + 1; i = edge[i].nxt){
        if(edge[i].w > 0){
            if(dis[s] == dis[edge[i].v] + 1){
                aug = min(aug, edge[i].w);
                Find(edge[i].v);
                if(dis[1] >= n) return;
                if(isFind){
                    dx = i;
                    break;
                }
                aug = augc;
            }
            minDis = min(minDis, dis[edge[i].v]);
        }
    }
    if(!isFind){
        gap[dis[s]]--;
        if(gap[dis[s]] == 0) dis[1] = n;
        dis[s] = minDis + 1;
        gap[dis[s]]++;
    }else{
        edge[dx].w -= aug;
        edge[dx ^ 1].w += aug;
    }
}

int main(){
    while(~scanf("%d%d%d%d", &n, &np, &nc, &m)) {//n作为源点，n+1作为汇点
        init();
        int ai, bi, ci;
        for(int i = 0; i < m; i++) { //ai到bi最大传输量为ci
            while(getchar() != '(');
            scanf("%d%*c%d%*c%d", &ai, &bi, &ci);
            ai += 2; bi += 2;
            addEdge(ai, bi, ci);
            addEdge(bi, ai, 0);
        }
        for(int i = 0; i < np; i++) {//ai最大发电量为bi
            while(getchar() != '(');
            scanf("%d%*c%d", &ai, &bi);
            ai+=2;
            addEdge(1, ai, bi);
            addEdge(ai, 1, 0);
        }
        for(int i = 0; i < nc; i++) {//ai最大消耗量为bi
            while(getchar() != '(');
            scanf("%d%*c%d", &ai, &bi);
            ai+=2;
            addEdge(ai, n + 2, bi);
            addEdge(n + 2, ai, 0);
        }
        //printf("%d\n", maxFlow(n, n + 1));
        n += 2;
        while(dis[1] < n){
            isFind = 0;
            aug = MAXN_INT;
            Find(1);
        }
        cout << maxFlow << endl;
    }
    return 0;
}