【题目链接】
【算法】
状压DP
【代码】
#include<bits/stdc++.h>
using namespace std;
#define MAXN 12
#define MOD 100000000
int M,N,i,j,k,ans,state;
int ST[MAXN+1][(1<<12)+1],f[MAXN+1][(1<<12)+1],cnt[MAXN+1],mat[MAXN+1][MAXN+1];
template <typename T> inline void read(T &x) {
int f = 1; x = 0;
char c = getchar();
for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
template <typename T> inline void write(T x) {
if (x < 0) { putchar('-'); x = -x; }
if (x > 9) write(x/10);
putchar(x%10+'0');
}
template <typename T> inline void writeln(T x) {
write(x);
puts("");
}
inline