找对象 ssl 2637 费用流

题目大意

分析

用以前的spfa费用流搞了两三天都不对。
一怒之下跑去学zkw，
学完，一A。

code

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>;

using namespace std;

struct arr{
    int x,y,w,c,next;
    int flag;
}edge[50000];
int ls[200];
int cur[200];
int dis[200];
int f[50000];
int v[200];
int sign[200];
int sss[200]; 
int edge_m;
int ans;
int s,t;
int n,m;

int add(int x,int y,int w,int c)
{
    edge_m++;
    edge[edge_m]=(arr){x,y,w,c,ls[x]},f[edge_m]=w,ls[x]=edge_m; 
    edge_m++;
    edge[edge_m]=(arr){y,x,w,-c,ls[y]},f[edge_m]=0,ls[y]=edge_m;
} 

int aug(int x,int min_)
{
    if (x==t) 
    {
        ans+=dis[s]*min_;
        return min_;
    }
    v[x]=1;
    int rec=min_;
    for (int i=ls[x];i;i=edge[i].next)
    {
        if ((!v[edge[i].y])&&(f[i]!=0)&&(dis[x]==dis[edge[i].y]+edge[i].c))
        {
            int k=aug(edge[i].y,min(rec,f[i]));
            if (k!=0) 
            {
                sign[x]=edge[i].y;
                sss[x]=i;
            }
            f[i]-=k;
            f[i^1]+=k;
            rec-=k;
            if (rec==0) return min_;
        }
    }
    return min_-rec;
}

bool modlabel()
{
    int min_=200000000;
    for (int i=s;i<=t;i++)
        if (v[i])
            for (int j=ls[i];j;j=edge[j].next)
                if ((f[j]!=0)&&(!v[edge[j].y]))
                    min_=min(min_,dis[edge[j].y]+edge[j].c-dis[i]);
    if (min_==200000000)    return true;
    for (int i=s;i<=t;i++)
        if (v[i])
        {
            v[i]=0;
            dis[i]+=min_;
        }
    return false;
}

void zkw()
{
    do
    {
        memset(v,0,sizeof(v));
        while (aug(s,200000000)>0)
            memset(v,0,sizeof(v));

    }while (!modlabel());
}
int ss[200];

int main()
{
    edge_m=1;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
        {
            int w;
            scanf("%d",&w);
            if (w!=0)   add(i,j+n,1,-w);
        }
    s=0;
    t=n+n+1;
    for (int i=1;i<=n;i++)
        add(s,i,1,0);
    for (int i=n+1;i<=n+n;i++)
        add(i,t,1,0);
    ans=0;
    zkw();
    printf("%d\n",-ans);
    int maxx=ans;
    for (int i=s;i<=t;i++)
        ss[i]=sss[i];
    for (int i=1;i<=n;i++)
    {
        ans=0;
        for (int i=2;i<=edge_m;i+=2)
        {
            f[i]=1;
            f[i^1]=0;
        }
        f[ss[i]]=0;
        f[ss[i]^1]=0;
        memset(dis,0,sizeof(dis));
        zkw();
        if (ans!=maxx)
            printf("%d %d\n",edge[ss[i]].x,edge[ss[i]].y-n);
    }
    return 0;
    fclose(stdin);
    fclose(stdout);
}