poj 3469 最大流 最小割

/*
题意是说有两个cpu，现在给你N个模块，
每个模块必须在两个cpu其中的一个中运行，
给出每个模块在不同cpu中运行的耗费，
并且如果两个不在同一个cpu运行的模块之间要交换数据的话需要额外的耗费........
解法：
建立超级源点 S，超级汇点 T;并对各个点拆点建立边（s,i,ai)和（i+n,t,bi) ,(i,i+n,inf),(u,v+n,w),(v+n,u,w);
然后求最大流 最小割就ok...
*/
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<memory.h>
using namespace std;
const int N=40012;
const int M=300002;
const int INF=1<<29;
int t,n,m,tot;
int gap[M],dis[M],pre[M],head[N],cur[N];
int NE,NV,sink,source;
struct Node
{
    int c,pos,next;
} E[M*4];
#define FF(i,NV) for(int i=0;i<NV;i++)
int sap(int s,int t)
{
    memset(dis,0,sizeof(int)*(NV+1));
    memset(gap,0,sizeof(int)*(NV+1));
    FF(i,NV) cur[i] = head[i];
    int u = pre[s] = s,maxflow = 0,aug =INF;
    gap[0] = NV;
    while(dis[s] < NV)
    {
loop:
        for(int &i = cur[u]; i != -1; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c && dis[u] == dis[v] + 1)
            {
                aug=min(aug,E[i].c);
                pre[v] = u;
                u = v;
                if(v == t)
                {
                    maxflow += aug;
                    for(u = pre[u]; v != s; v = u,u = pre[u])
                    {
                        E[cur[u]].c -= aug;
                        E[cur[u]^1].c += aug;
                    }
                    aug =INF;
                }
                goto loop;
            }
        }
        if( (--gap[dis[u]]) == 0)   break;
        int mindis = NV;
        for(int i = head[u]; i != -1 ; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c && mindis > dis[v])
            {
                cur[u] = i;
                mindis = dis[v];
            }
        }
        gap[ dis[u] = mindis+1 ] ++;
        u = pre[u];
    }
    return maxflow;
}
void addEdge(int u,int v,int c )
{
    E[NE].c = c;
    E[NE].pos = v;
    E[NE].next = head[u];
    head[u] = NE++;
    E[NE].c = 0;
    E[NE].pos = u;
    E[NE].next = head[v];
    head[v] = NE++;
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int i,j,ai,bi,u,v,w;
        source=0,sink=n<<1|1,NE=0,NV=sink+1;
        memset(head,-1,sizeof(int)*(NV));
        for(i=1; i<=n; i++)
        {
            scanf("%d%d",&ai,&bi);
            addEdge(i,i+n,INF);
            addEdge(source,i,ai);
            addEdge(i+n,sink,bi);
        }
        for(i=1; i<=m; i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            addEdge(u,v+n,w);
            addEdge(v+n,u,w);
        }
        int ans=sap(source,sink);
        printf("%d\n",ans);
    }
    return 0;
}