一 状压搜索
SGU 527 Explode 'Em All
枚举攻击哪一行,将未被消灭的列记录下来,若小于行数,则记录下答案。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxs=1<<25;
const int maxn=25;
char map[maxn][maxn];
int n,m;
int bit[maxn];
int col[maxs];
int ans;
void dfs(int deep,int set,int row){
if (deep==n){
if (row>=col[set]&&row<ans){
ans=row;
}
return;
}
dfs(deep+1,set|bit[deep],row);
dfs(deep+1,set,row+1);
}
int main()
{
cin>>n>>m;
for (int i=0;i<n;i++){
for (int j=0;j<m;j++){
cin>>map[i][j];
if (map[i][j]=='*') bit[i]|=(1<<j);
}
}
ans=n;
for (int i=0;i<(1<<m);i++) col[i]=col[(i>>1)]+(i&1);
dfs(0,0,0);
cout<<ans<<endl;
return 0;
}
------------------------------