[poj 3436]最大流+输出结果每条边流量

题目链接：http://poj.org/problem?id=3436

大力套kuangbin板过了orz

#include<cstdio>
#include<cstring>
using namespace std;

const int MAXN = ;
const int MAXM = ;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int to,next,cap,flow;
} edge[MAXM];
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN];
void init()
{
    tol = ;
    memset(head,-,sizeof(head));
}
void addedge(int u,int v,int w,int rw=)
{
    edge[tol].to = v;
    edge[tol].cap = w;
    edge[tol].next = head[u];
    edge[tol].flow = ;
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = rw;
    edge[tol].next = head[v];
    edge[tol].flow = ;
    head[v]=tol++;
}
int sap(int start,int end,int N)
{
    memset(gap,,sizeof(gap));
    memset(dep,,sizeof(dep));
    memcpy(cur,head,sizeof(head));
    int u = start;
    pre[u] = -;
    gap[] = N;
    int ans = ;
    while(dep[start] < N)
    {
        if(u == end)
        {
            int Min = INF;
            for(int i = pre[u]; i != -; i = pre[edge[i^].to])
                if(Min > edge[i].cap - edge[i].flow)
                    Min = edge[i].cap - edge[i].flow;
            for(int i = pre[u]; i != -; i = pre[edge[i^].to])
            {
                edge[i].flow += Min;
                edge[i^].flow -= Min;
            }
            u = start;
            ans += Min;
            continue;
        }
        bool flag = false;
        int v;
        for(int i = cur[u]; i != -; i = edge[i].next)
        {
            v = edge[i].to;
            if(edge[i].cap - edge[i].flow && dep[v]+ == dep[u])
            {
                flag = true;
                cur[u] = pre[v] = i;
                break;
            }
        }
        if(flag)
        {
            u = v;
            continue;
        }
        int Min = N;
        for(int i = head[u]; i != -; i = edge[i].next)
            if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
            {
                Min = dep[edge[i].to];
                cur[u] = i;
            }
        gap[dep[u]]--;
        if(!gap[dep[u]])return ans;
        dep[u] = Min+;
        gap[dep[u]]++;
        if(u != start) u = edge[pre[u]^].to;
    }
    return ans;
}

int P;

bool jr(int out,int in)
{
    for (int i=; i<P; i++)
    {
        int tout=out%;
        int tin=in%;
        if (tout== && tin== || tout== && tin==) return false;
        out/=;
        in/=;
    }
    return true;
}

int input[MAXN],output[MAXN];
int ef[MAXN];

int main()
{
    init();
    int n;
    scanf("%d%d",&P,&n);
    for (int i=; i<n; i++)
    {
        scanf("%d",&ef[i]);
        int tout=,tin=;
        for (int j=; j<P; j++)
        {
            int x;
            scanf("%d",&x);
            tin=tin*+x;
        }
        for (int j=; j<P; j++)
        {
            int x;
            scanf("%d",&x);
            tout=tout*+x;
        }
        input[i]=tin;
        output[i]=tout;
    }
    output[n]=;
    input[n+]=;
    for (int j=; j<P; j++) input[n+]=input[n+]*+;
    for (int i=;i<n;i++) addedge(i,i+n,ef[i]);
    for (int i=; i<n; i++)
        for (int j=; j<n; j++)
        {
            if (jr(output[i],input[j]))
            {
                addedge(i+n,j,ef[i]);
            }
        }
    for (int i=; i<n; i++) if (jr(output[n],input[i])) addedge(n+n,i,INF);
    for (int i=; i<n; i++) if (jr(output[i],input[n+])) addedge(i+n,n+n+,ef[i]);

    printf("%d ",sap(n+n,n+n+,n+n+));

    int cnt=;
    for (int i=;i<n;i++)
    {
        for (int j=head[i+n];j!=-;j=edge[j].next)
        {
            if (edge[j].flow> && edge[j].to>= && edge[j].to<n) cnt++;
        }
    }
    printf("%d\n",cnt);
    for (int i=;i<n;i++)
    {
        for (int j=head[i+n];j!=-;j=edge[j].next)
        {
            if (edge[j].flow> && edge[j].to>= && edge[j].to<n) printf("%d %d %d\n",i+,edge[j].to+,edge[j].flow);
        }
    }
    return ;
}