题目链接
https://www.luogu.org/problemnew/show/P4014
分配问题
非常经典的模型,就是一个带权的二分图最大匹配,要求满足最大匹配的同时权值最大,那么我们显然想到费用流,A类点向B类点连边的时候费用设为贡献就行了,最大贡献的话spfa跑最长路,最小贡献spfa跑最短路就行了
#include<cstdio>
#include<algorithm>
#include<cctype>
#include<cstring>
#include<iostream>
#define LL long long
#define INF (2139062143)
#define N (100001)
using namespace std;
int n,S,T,x,k,ans,h,t;
int head[N],nxt[N],fare[N],fl[N],from[N],a[N],dis[N],q[N],aa[101][101];
bool vis[N];
template <typename T> void read(T&t) {
t=0;
bool fl=true;
char p=getchar();
while (!isdigit(p)) {
if (p=='-') fl=false;
p=getchar();
}
do {
(t*=10)+=p-48;p=getchar();
}while (isdigit(p));
if (!fl) t=-t;
}
inline void add(int x,int y,int z,int data){
a[++k]=y,fl[k]=z,fare[k]=data,nxt[k]=head[x],head[x]=k;
}
int spfa(){
memset(dis,-127,sizeof(dis));
dis[S]=0;
h=t=0;
q[++t]=S;
vis[S]=1;
while (h<=t){
int u=q[++h];
for (int p=head[u];~p;p=nxt[p]){
if (fl[p]&&fare[p]+dis[u]>dis[a[p]]){
dis[a[p]]=dis[u]+fare[p];
from[a[p]]=p;
if (!vis[a[p]]){
q[++t]=a[p];
vis[a[p]]=1;
}
}
}
vis[u]=0;
}
return dis[T];
}
int spfaa(){
memset(dis,127,sizeof(dis));
dis[S]=0;
h=t=0;
q[++t]=S;
vis[S]=1;
while (h<=t){
int u=q[++h];
for (int p=head[u];~p;p=nxt[p]){
if (fl[p]&&fare[p]+dis[u]<dis[a[p]]){
dis[a[p]]=dis[u]+fare[p];
from[a[p]]=p;
if (!vis[a[p]]){
q[++t]=a[p];
vis[a[p]]=1;
}
}
}
vis[u]=0;
}
return dis[T];
}
int main(){
read(n);
S=n*2+1,T=n*2+2;
memset(head,-1,sizeof(head));
k=1;
for (int i=1;i<=n;i++){
add(S,i,1,0);
add(i,S,0,0);
}
for (int i=n+1;i<=n*2;i++){
add(i,T,1,0);
add(T,i,0,0);
}
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
read(aa[i][j]);
x=aa[i][j];
add(i,j+n,1,x);
add(j+n,i,0,-x);
}
}
while (spfaa()!=dis[0]){
int now=T;
while (now!=S){
fl[from[now]]--;
fl[from[now]^1]++;
now=a[from[now]^1];
}
ans+=dis[T];
}
printf("%d\n",ans);
ans=0;
memset(head,-1,sizeof(head));
k=1;
for (int i=1;i<=n;i++){
add(S,i,1,0);
add(i,S,0,0);
}
for (int i=n+1;i<=n*2;i++){
add(i,T,1,0);
add(T,i,0,0);
}
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
x=aa[i][j];
add(i,j+n,1,x);
add(j+n,i,0,-x);
}
}
while (spfa()!=dis[0]){
int now=T;
while (now!=S){
fl[from[now]]--;
fl[from[now]^1]++;
now=a[from[now]^1];
}
ans+=dis[T];
}
printf("%d",ans);
return 0;
}