“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛 L 零件组装 状态压缩+预处理优化+枚举子集

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
#define pii pair<int,int>
#define MP make_pair
typedef long long LL;
const long long INF = 1e18+1LL;
const double pi = acos(-1.0);
const int N = 50+10, M = 1e3+20,inf = 2e9;


int T,a[N][N],b[N][N],n;
LL dp[1<<15];
LL G[1<<15];
LL F[1<<15];
int ji[1<<15];
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%d",&n);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j) scanf("%d",&a[i][j]);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j) scanf("%d",&b[i][j]);
         int U = (1<<n) - 1;
         for(int i = 0; i <= U; ++i) {
            ji[i] = 0;F[i] = 0;
            G[i] = 0;
         }
        for(int i = 0; i <= U; ++i) {
            for(int j = 0; j < n; ++j) {
                if(((1<<j)&i)) ji[i]++;
               for(int k = j+1; k < n; ++k) {
                if(((i&(1<<j)) && (i&(1<<k))) && a[j][k]) G[i]++;
               }
            }
         }
        for(int i = 0; i <= U; ++i) {
            for(int j = 0; j < n; ++j) {
               for(int k = j+1; k < n; ++k) {
                if(((i&(1<<j)) && (i&(1<<k))) && b[j][k]) F[i]++;
               }
            }
         }
         //cout<<F[15]<<" "<<F[6]<<" "<<F[9]<<endl;
        for(int i = 0; i <= U; ++i) dp[i] = INF;
        dp[0] = 0;
        for(int i = 0; i < n; ++i) dp[1<<i] = 0;

        for(int ii = 0; ii <= U; ++ii) {
             for(int jj = ii; jj; jj = (jj-1)&ii)
            {
                int i = jj, j = ii^jj;
                if(G[i|j] - G[i] - G[j]) {
                    dp[i|j] = min(dp[i|j],dp[i]+dp[j]+1LL*(F[i|j] - F[i] - F[j])*max(ji[i],ji[j]));
                }
            }
        }
        printf("%lld\n",dp[U]);
    }
    return 0;
}