ZOJ 3885 The Exchange of Items

最小费用最大流~。。 建图需要理解理解，其他都是模板

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int MAXN = 10000;
const int MAXM = 100000;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int to, next, cap, flow, cost;
} edge[MAXM];
int head[MAXN], tol;
int pre[MAXN]; //储存前驱顶点
int dis[MAXN]; //储存到源点s的距离
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = 2*n+2;
    tol = 0;
    memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int cap, int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s, int t)
{
    queue<int>q;
    for (int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for (int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if (edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost)
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if (!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if (pre[t] == -1)return false;
    else return true;
}

//返回的是最大流， cost存的是最小费用

int minCostMaxflow(int s, int t, int &cost)
{
    int flow = 0;
    cost = 0;
    while (spfa(s, t))
    {
        int Min = INF;
        for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
        {
            if (Min > edge[i].cap - edge[i].flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
        {
            edge[i].flow += Min;
            edge[i ^ 1].flow -= Min;
            cost += edge[i].cost * Min;
        }
        flow += Min;
    }
    return flow;
}

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int sum1,sum2;
        sum1=sum2=0;
        int a,b;
        init(n);
        int s=0;
        int t=n*2+1;
//        for(int i=1; i<=n; i++)
//        {
//            cin>>a>>b;
//            sum1+=a;
//            sum2+=b;
//            addedge(s,i,a,0);
//            addedge(i,i+n,INF,0);
//            addedge(i+n,t,b,0);
//        }
//        for(int i=1; i<=m; i++)
//        {
//            cin>>a>>b;
//             addedge(n+b,a,INF,1);
//             addedge(n+a,b,INF,1);
//
//        }
        //这样建边其实就可以了 不用再多一条路
        
        for(int i=1; i<=n; i++)
        {
            cin>>a>>b;
            sum1+=a;
            sum2+=b;
            addedge(s,i,a,0);
            // addedge(i,i+n,INF,0);
            // addedge(i+n,t,b,0);
            addedge(i,t,b,0);
        }
        for(int i=1; i<=m; i++)
        {
            cin>>a>>b;
            // addedge(n+b,a,INF,1);
            // addedge(n+a,b,INF,1);
            addedge(b,a,INF,1);
            addedge(a,b,INF,1);

        }




        int cost;
        if(sum1!=sum2)
            cout<<"-1"<<endl;
        else
        {
            int sumzong=minCostMaxflow(s,t,cost);
            if(sumzong==sum2)
                cout<<cost<<endl;
            else
                cout<<-1<<endl;
        }
    }
    return 0;
}