//状态压缩DP
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
const int N=17, M=1600;
int map[N][N], p[N], val[M][N], dp[N][M], sum[N][M];
vector<int> mat[M];
int n,num,ans;
void Make()
{
memset(p,0,sizeof(p));
int i,j,m,tmp,x;
num=0;
m=(1<<n)-1;
for(i=0;i<=m;i++)
{
tmp=n; x=i;
while(x){
p[tmp--]=x%2;
x/=2;
}
for(j=2;j<=......
阅读全文