“亚信科技杯”南邮第七届大学生程序设计竞赛之网络预赛 A noj 2073 FFF [ 二分图最大权匹配 || 最大费用最大流 ]

  1 #include <cstdio>
  2 #include <cstring>
  3 #include <stack>
  4 #include <vector>
  5 #include <algorithm>
  6 #include <map>
  7 #include <string>
  8 #include <queue>
  9 #include <cmath>
 10 
 11 #define ll long long
 12 int const N = 35;
 13 int const M = 100005;
 14 int const INF = 0x3f3f3f3f;
 15 ll const mod = 1000000007;
 16 
 17 using namespace std;
 18 
 19 int T;
 20 int n;
 21 int nx,ny;       //两边的点数
 22 int g[N][N];    //二分图描述
 23 int linker[N],lx[N],ly[N];      //y中各点匹配状态，x,y中的点标号
 24 int slack[N];
 25 bool visx[N],visy[N];
 26 
 27 bool DFS(int x)
 28 {
 29     visx[x] = true;
 30     for(int y = 0;y < ny;y++)
 31     {
 32         if(visy[y]) continue;
 33         int tmp = lx[x] + ly[y] -g[x][y];
 34         if(tmp == 0)
 35         {
 36             visy[y] = true;
 37             if(linker[y] == -1 || DFS(linker[y]))
 38             {
 39                 linker[y] = x;
 40                 return true;
 41             }
 42         }
 43         else if(slack[y] > tmp)
 44             slack[y] = tmp;
 45     }
 46     return false;
 47 }
 48 
 49 int KM()
 50 {
 51     memset(linker,-1,sizeof(linker));
 52     memset(ly,0,sizeof(ly));
 53     for(int i = 0;i < nx;i++)
 54     {
 55         lx[i] = -INF;
 56         for(int j = 0;j < ny;j++)
 57             if(g[i][j] > lx[i])
 58                 lx[i] = g[i][j];
 59     }
 60     for(int x =0;x < nx;x++)
 61     {
 62         for(int i = 0;i < ny ;i++)
 63             slack[i] = INF;
 64         while(true)
 65         {
 66             memset(visx,false,sizeof(visx));
 67             memset(visy,false,sizeof(visy));
 68             if(DFS(x)) break;
 69             int d = INF;
 70             for(int i = 0;i < ny;i++)
 71                 if(!visy[i] && d > slack[i])
 72                     d = slack[i];
 73             for(int i = 0 ; i < nx ;i++)
 74                 if(visx[i])
 75                     lx[i] -= d;
 76             for(int i = 0 ; i < ny ;i++)
 77             {
 78                 if(visy[i]) ly[i] += d;
 79                 else slack[i] -= d;
 80             }
 81         }
 82     }
 83     int res = 0;
 84     for(int i = 0;i < ny ;i++)
 85         if(linker[i] != -1)
 86             res += g[ linker[i] ][i];
 87     return res;
 88 }
 89 
 90 void ini()
 91 {
 92     scanf("%d",&n);
 93     int i,j;
 94     for(i = 0;i < n;i++){
 95         for(j = 0;j < n;j++)
 96             scanf("%d",&g[i][j]);
 97     }
 98     nx = ny =n;
 99 }
100 
101 void solve()
102 {
103 
104 }
105 
106 void out()
107 {
108     printf("%d\n",KM());
109 }
110 
111 int main()
112 {
113     //freopen("data.in","r",stdin);
114     //freopen("data.out","w",stdout);
115     scanf("%d",&T);
116     //for(int cnt=1;cnt<=T;cnt++)
117     while(T--)
118     //while(scanf("%d%d%d",&a,&b,&n)!=EOF)
119     {
120         ini();
121         solve();
122         out();
123     }
124 }