Power Network 【POJ - 1459】【最大流】

题目链接

---

  题意：有这样的三种能量机器，分别为能量发射器、能量传输装置、能量接收器，我们给出N个能量器（包括能量发射器和能量接收器），然后有NP个能量发射器，还有NC个能量接收器，最后是M个能量传输装置。输入是这四个之后，出输入M个这样的边，分别是"(u,v)w"代表u->v可以流过一条流量为w的边，然后NP个供能装置"(u)w"代表u这号装置是功能装置，并且能提供w的能量，同理，NC个能量接收装置，"(u)w"代表能接收w的能量。问最后能收到多少能量总和，求最大值。

  思路：直接去走一遍最大流即可，这道题难就难在题面太难理解了。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define esp 1e-6
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int S = 0, maxN = 107, maxE = 2e4 + 500 + 7;
int N, NP, NC, M, cnt, head[maxN], cur[maxN], T;
struct Eddge
{
    int nex, to, flow;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int flow)
{
    edge[cnt] = Eddge(head[u], v, flow);
    head[u] = cnt++;
}
inline void _add(int u, int v, int flow) { addEddge(u, v, flow); addEddge(v, u, 0); }
queue<int> Q;
int deep[maxN];
bool bfs()
{
    memset(deep, 0, sizeof(deep));
    while(!Q.empty()) Q.pop();
    Q.push(S);  deep[S] = 1;
    while(!Q.empty())
    {
        int u = Q.front();  Q.pop();
        for(int i=head[u], v, f; ~i; i=edge[i].nex)
        {
            v = edge[i].to; f = edge[i].flow;
            if(!deep[v] && f)
            {
                deep[v] = deep[u] + 1;
                Q.push(v);
            }
        }
    }
    return deep[T];
}
int dfs(int u, int dist)
{
    if(u == T) return dist;
    for(int &i=cur[u], v, f, di; ~i; i=edge[i].nex)
    {
        v = edge[i].to; f = edge[i].flow;
        if(deep[v] == deep[u] + 1 && f)
        {
            di = dfs(v, min(dist, f));
            if(di)
            {
                edge[i].flow -= di;
                edge[i^1].flow += di;
                return di;
            }
        }
    }
    return 0;
}
int Dinic()
{
    int ans = 0, tmp = 0;
    while(bfs())
    {
        for(int i=S; i<=T; i++) cur[i] = head[i];
        while((tmp = dfs(S, INF))) ans += tmp;
    }
    return ans;
}
inline void init()
{
    cnt = 0;    T = N + 1;
    memset(head, -1, sizeof(head));
}
int main()
{
    while(scanf("%d%d%d%d", &N, &NP, &NC, &M)!=EOF)
    {
        init();
        for(int i=1, u, v, w; i<=M; i++)
        {
            while(getchar() != '(') continue;
            scanf("%d,%d)%d", &u, &v, &w);
            ++u;    ++v;
            _add(u, v, w);
        }
        for(int i=1, u, w; i<=NP; i++)
        {
            while(getchar() != '(') continue;
            scanf("%d)%d", &u, &w);
            ++u;
            _add(S, u, w);
        }
        for(int i=1, u, w; i<=NC; i++)
        {
            while(getchar() != '(') continue;
            scanf("%d)%d", &u, &w);
            ++u;
            _add(u, T, w);
        }
        printf("%d\n", Dinic());
    }
    return 0;
}