1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
| #include<bits/stdc++.h> #define INIT(a,b) memset(a,b,sizeof(a)) #define LL long long using namespace std; const int inf=0x3f3f3f3f; const int maxn=3e2+7; const int mod=1e9+7; int line[maxn][maxn],visx[maxn],visy[maxn],wx[maxn],wy[maxn],another[maxn]; int n,t,minsub; bool Find(int x){ visx[x]=1; for(int i=1;i<=n;i++){ if(visy[i])continue; t=wx[x]+wy[i]-line[x][i]; if(t==0){ visy[i]=1; if(!another[i]||Find(another[i])){ another[i]=x; return true; } } else if(t>0) minsub=min(minsub,t); } return false; } int Km(){ for(int i=1;i<=n;i++){ while(1){ INIT(visx,0);INIT(visy,0); minsub=inf; if(Find(i))break; for(int j=1;j<=n;j++){ if(visx[j]) wx[j]-=minsub ; if(visy[j]) wy[j]+=minsub ; } } } int ans=0; for(int i=1;i<=n;i++) if(another[i]) ans+=line[another[i]][i]; return ans; } int main(){ while(~scanf("%d", &n)){ INIT(wx,0),INIT(wy,0); INIT(another,0); for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ scanf("%d",&line[i][j]); wx[i]=max(wx[i],line[i][j]); } } printf("%d\n",Km()); }
return 0; }
|