hdu2853

题解：

KM算法模板

然后我把另一边加了点

然后写了#define int long long

然后莫名挂。。。

然后去掉就过了

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=;
int n,m,a[N][N],slack[N],x,exr[N],exl[N],match[N],visl[N],visr[N];
int dfs(int x)
{
    visl[x]=;
    for (int i=;i<=n;i++)
     if (!visr[i])
      {
          int k=exl[x]+exr[i]-a[x][i];
          if (k==)
           {
               visr[i]=;
               if (!match[i]||dfs(match[i]))
                {
                    match[i]=x;
                    return ;
                }
           }
          else slack[i]=min(slack[i],k);
      }
    return ;
}
int main()
{
    while (~scanf("%d%d",&n,&m))
     {
         int ans1=;
         memset(a,,sizeof a);
         for (int i=;i<=n;i++)
         for (int j=;j<=m;j++)
          scanf("%d",&x),a[j][i]=x*;
        for (int i=;i<=n;i++)
         scanf("%d",&x),ans1+=a[x][i],a[x][i]++;
        int kkk=n;n=m;
        memset(exl,,sizeof exl);
        for (int i=;i<=n;i++)
         for (int j=;j<=n;j++)
          exl[i]=max(a[i][j],exl[i]);
        memset(match,,sizeof match);
        memset(exr,,sizeof exr);
        for (int i=;i<=n;i++)
         {
             for (int j=;j<=n;j++)slack[j]=1e9;
            while ()
             {
                 memset(visl,,sizeof visl);
                 memset(visr,,sizeof visr);
                 if (dfs(i))break;
                 int d=1e9;
                 for (int j=;j<=n;j++)
                  if (!visr[j])d=min(d,slack[j]);
                 for (int j=;j<=n;j++)
                 {
                     if (visl[j])exl[j]-=d;
                     if (visr[j])exr[j]+=d;
                     else slack[j]-=d;
                 }
             }
         }
        int ans=;
        for (int i=;i<=m;i++)
         ans+=a[match[i]][i];
        printf("%d %d\n",kkk-ans%,(ans-ans1)/);
     }
}