HDU2255--奔小康赚大钱--KM

简单模板题，记录下O(N*N*N)的模板。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 300+66
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
#define mod 1000000007
#define INF 0x3f3f3f3f

struct KM
{
    int nx,ny;
    int linker[maxn];
    int slack[maxn];
    int lx[maxn],ly[maxn];
    int visx[maxn],visy[maxn];
    int w[maxn][maxn];
    void init(int x,int y)
    {
        nx=x;
        ny=y;
        memset(w,INF,sizeof(w));
    }
    int dfs(int x)
    {
        visx[x]=1;
        for(int y=1; y<=ny; y++)
        {
            if(visy[y])
                continue;
            int tmp=lx[x]+ly[y]-w[x][y];
            if(tmp==0)
            {
                visy[y]=1;
                if(linker[y]==-1||dfs(linker[y]))
                {
                    linker[y]=x;
                    return 1;
                }
            }
            else if(slack[y]>tmp)
                slack[y]=tmp;
        }
        return 0;
    }
    int km()
    {
        int i,j;
        memset(linker,-1,sizeof(linker));
        memset(ly,0,sizeof(ly));
        for(i=1; i<=nx; i++)
            for(j=1,lx[i]=-INF; j<=ny; j++)
                if(w[i][j]>lx[i])
                    lx[i]=w[i][j];
        for(int x=1; x<=nx; x++)
        {
            for(i=1; i<=ny; i++)
                slack[i]=INF;
            while(1)
            {
                memset(visx,0,sizeof(visx));
                memset(visy,0,sizeof(visy));
                if(dfs(x))
                    break;
                int d=INF;
                for(i=1; i<=ny; i++)
                    if(!visy[i]&&d>slack[i])
                        d=slack[i];
                for(i=1; i<=nx; i++)
                    if(visx[i])
                        lx[i]-=d;
                for(i=1; i<=ny; i++)
                    if(visy[i])
                        ly[i]+=d;
                    else
                        slack[i]-=d;
            }
        }
        int res=0;
        for(i=1; i<=ny; i++)
            if(linker[i]!=-1)
                res+=w[linker[i]][i];
        return res;
    }
} kk;
int n;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        kk.init(n,n);
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                scanf("%d",&kk.w[i][j]);
            }
        printf("%d\n",kk.km());
    }
    return 0;
}

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#define for0(a,b) for(a=0;a<b;++a)
#define for1(a,b) for(a=1;a<=b;++a)
#define foru(i,a,b) for(i=a;i<=b;++i)
#define ford(i,a,b) for(i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const int maxn = 310;
const int INF = 1e9;
/*KM算法
 *O(nx*nx*ny)
 *求最大权匹配
 *若求最小权匹配，可将权值取相反数，结果再取相反数。
 */
int nx, ny;
int g[maxn][maxn];
int linker[maxn], lx[maxn], ly[maxn];//y中各点匹配状态,x,y中的顶标
int slack[maxn];
bool visx[maxn], visy[maxn];
 
bool DFS(int x)
{
    visx[x] = true;
    for(int y=0; y<ny; ++y){
        if(visy[y]) continue;
        int tmp = lx[x] + ly[y] - g[x][y];
        if(tmp == 0){
            visy[y] = true;
            if(linker[y] == -1 || DFS(linker[y])){
                linker[y] = x;
                return true;
            }
        }
        else if(slack[y]> tmp)
            slack[y] = tmp;
    }
    return false;
}
 
int KM()
{
    memset(linker, -1, sizeof linker );
    memset(ly, 0, sizeof ly );
    for(int i=0; i<nx; ++i){
        lx[i] = - INF;
        for(int j=0; j<ny; ++j)
            if(g[i][j]> lx[i])
                lx[i] = g[i][j];
    }
    for(int x=0; x<nx; ++x)
    {
        for(int i=0; i<ny; ++i)
            slack[i] = INF;
        while(true)
        {
            memset(visx, false, sizeof visx );
            memset(visy, false, sizeof visy );
            if(DFS(x)) break;
            int d = INF;
            for(int i=0; i<ny; ++i)
                if(!visy[i] && d>slack[i])
                    d = slack[i];
            for(int i=0; i<nx; ++i)
                if(visx[i])
                    lx[i] -= d;
            for(int i=0; i<ny; ++i)
            {
                if(visy[i]) ly[i] += d;
                else slack[i] -= d;
            }
        }
    }
    int res = 0;
    for(int i=0; i<ny; ++i)
        if(linker[i] != -1)
            res += g[linker[i]][i];
    return res;
}
 
//HDU 2255
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.cpp","r",stdin);
    freopen("out.cpp", "w", stdout);
#endif // ONLINE_JUDGE
    int n;
    while(~scanf("%d", &n))
    {
        for(int i=0; i<n; ++i)
            for(int j=0; j<n; ++j)
                scanf("%d", &g[i][j]);
        nx = ny = n;
        printf("%d\n" ,KM());
    }
    return 0;
}
 

记录模板

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=30;
int T,n,m,k,a[10005],b[10005];
char s[3];
int nx,ny;
int linker[maxn],lx[maxn],ly[maxn],slack[maxn];
int visx[maxn],visy[maxn],w[maxn][maxn];
int dfs(int x)
{
    visx[x]=1;
    for(int y=1;y<=ny;y++)
    {
        if(visy[y])
            continue;
        int tmp=lx[x]+ly[y]-w[x][y];
        if(tmp==0)
        {
            visy[y]=1;
            if(linker[y]==-1||dfs(linker[y]))
            {
                linker[y]=x;
                return 1;
            }
        }
        else if(slack[y]>tmp)
            slack[y]=tmp;
    }
    return 0;
}
int km()
{
    int i,j;
    memset(linker,-1,sizeof(linker));
    memset(ly,0,sizeof(ly));
    for(i=1;i<=nx;i++)  
        for(j=1,lx[i]=-INF;j<=ny;j++)
            if(w[i][j]>lx[i])
                lx[i]=w[i][j];
    for(int x=1;x<=nx;x++)
    {
        for(i=1;i<=ny;i++)
            slack[i]=INF;
        while(1)
        {
            memset(visx,0,sizeof(visx));
            memset(visy,0,sizeof(visy));
            if(dfs(x)) 
                break;  
            int d=INF;
            for(i=1;i<=ny;i++)
                if(!visy[i]&&d>slack[i])
                    d=slack[i];
            for(i=1;i<=nx;i++)
                if(visx[i])
                    lx[i]-=d;
            for(i=1;i<=ny;i++) 
                if(visy[i])
                    ly[i]+=d;
                else
                    slack[i]-=d;
        }
    }
    int res=0;
    for(i=1;i<=ny;i++)
        if(linker[i]!=-1)
            res+=w[linker[i]][i];
    return res;
}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&k,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%s",s);
            a[i]=s[0]-'A'+1;
        }
        while(m--)
        {
            for(int i=1;i<=n;i++)
            {
                scanf("%s",s);
                b[i]=s[0]-'A'+1;
            }
            nx=ny=26;
            memset(w,0,sizeof(w));
            for(int i=1;i<=n;i++)
                w[b[i]][a[i]]++;
            printf("%.4f\n",1.0*km()/n);
        }
    }
    return 0;
}