裸的KM,,
#include<iostream>
#include<map>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<set>
#include<string.h>
#include<string>
#include<vector>
#define MX 111
#define INF 0x3f3f3f3f
#define mem(x,y) memset(x,y,sizeof(x))
#define FIN freopen("input.txt","r",stdin)
using namespace std;
int G[MX][MX],nx,ny;//nx<=ny,不存在的边用权值为0,必须存在完备匹配
int lx[MX],ly[MX],match[MX],slack[MX];
bool visx[MX],visy[MX];
bool KM_dfs(int u) {
visx[u]=1;
for(int i=1; i<=ny; i++) {//ny吧
if(lx[u]+ly[i]==G[u][i]&&!visy[i]) {
visy[i]=1;
if(match[i]==-1||KM_dfs(match[i])) {
match[i]=u;
return 1;
}
} else if(lx[u]+ly[i]!=G[u][i])slack[i]=min(slack[i],lx[u]+ly[i]-G[u][i]);
}
return 0;
}
void update() {
int d=INF;
for(int i=1; i<=ny; i++) if(!visy[i]) d=min(d,slack[i]);
for(int i=1; i<=nx; i++) if(visx[i]) lx[i]-=d;
for(int i=1; i<=ny; i++) if(visy[i]) ly[i]+=d;
else slack[i]-=d;
}
int KM() {
mem(ly,0);
mem(match,-1);
for(int i=1; i<=nx; i++) {
lx[i]=-INF;
for(int j=1; j<=ny; j++)lx[i]=max(lx[i],G[i][j]);
}
for(int i=1; i<=nx; i++) {
mem(slack,0x3f);
while(1) {
mem(visx,0);
mem(visy,0);
if(KM_dfs(i)) break;
else update();
}
}
int ans=0;
for(int i=1; i<=ny; i++) ans+=match[i]==-1?0:G[match[i]][i];
return ans;
}
int main() {
FIN;
while(~scanf("%d",&nx)) {
ny=nx;
for(int i=1; i<=nx; i++)
for(int j=1; j<=ny; j++) {
scanf("%d",&G[i][j]);
G[i][j]=-G[i][j];
}
printf("%d\n",-KM());
for(int i=1; i<=nx; i++)
for(int j=1; j<=ny; j++) G[i][j]=-G[i][j];
printf("%d\n",KM());
}
return 0;
}