http://acm.hdu.edu.cn/showproblem.php?pid=5823
这题是求一个子图的最少染色数,开头觉得,这不就是搜索么, O(n2) 的复杂度,但是后来听说最小染色数是np问题,如果搜索可以解决这不就是多项式了么,GG
正确方法应该是枚举独立的子集, O(3n) 的复杂度,独立的子集是里面的点两两之间都没有边,所以这个子集可以涂同一种颜色,所以转移就是 f[s]=min(f[ss0]+1),s0为独立集
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
#define MAX 100005
#define MAXN 1000005
#define maxnode 205
#define sigma_size 26
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
//const int prime = 999983;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-4;
const LL mod = 1e9+7;
const ull mx = 133333331;
/*****************************************************/
inline void RI(int &x) {
char c;
while((c=getchar())<'0' || c>'9');
x=c-'0';
while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/
int vis[20][20];
int du[(1<<18)+5];
int dp[(1<<18)+5];
char s[20];
unsigned qpow(unsigned a,int n){
unsigned ans=1;
while(n){
if(n&1) ans=ans*a;
a=a*a;
n>>=1;
}
return ans;
}
int main(){
//freopen("in.txt","r",stdin);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
mem(vis,0);
for(int i=0;i<n;i++){
scanf("%s",s);
for(int j=0;j<n;j++){
if(s[j]=='1') vis[i][j]=1;
}
}
for(int i=0;i<(1<<n);i++){
int flag=1;
for(int j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if((i&(1<<j))&&(i&(1<<k))){
if(vis[j][k]) flag=0;
}
}
}
du[i]=flag;
}
dp[0]=0;
unsigned ans=0;
for(int i=1;i<(1<<n);i++){
dp[i]=INF;
for(int s=i;s;s=i&(s-1)){
if(du[s]){
dp[i]=min(dp[i],dp[i^s]+1);
}
}
ans+=qpow((unsigned)233,i)*(unsigned)dp[i];
}
cout<<ans<<endl;
}
return 0;
}