uva10651 - Pebble Solitaire(状态压缩)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 4500
int dp
;
char s[25];
int dfs(int total)
{
int &ans = dp[total], temp;
if(ans!=-1) return ans;
ans = 0;
for(int i = 0; i < 12; i++) if(total&1<<i)
ans+=1;
for(int i = 0; i < 10; i++)
{
temp = total;
if((total&1<<i)&&(total&1<<(i+1))&&!(total&1<<(i+2)))
{
temp&=~(1<<i);
temp&=~(1<<(i+1));
temp|=(1<<(i+2));
ans = min(ans,dfs(temp));
}
temp = total;
if(!(total&1<<i)&&(total&1<<(i+1))&&(total&1<<(i+2)))
{
temp&=~(1<<(i+2));
temp&=~(1<<(i+1));
temp|=(1<<i);
ans = min(ans,dfs(temp));
}
}
return ans;
}
int main ()
{
int total, cas;
scanf("%d",&cas);getchar();
while(cas--)
{
memset(dp,-1,sizeof(dp));
scanf("%s",s);getchar();
total = 0;
for(int i = 0; i < 12; i++)
{
if(s[i]=='o')
total^=(1<<i);
}
printf("%d\n",dfs(total));
}
return 0;
}