记忆化搜索
判断011和110,然后异或111
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#define MOD 1000000007
#define LL long long
#define Inf (1<<30)
using namespace std;
int res,d[1<<13];
int calc(int x)
{
int i,sum=0;
for(i=0;i<12;i++)
if((x>>i)&1)sum++;
return sum;
}
void dp(int x)
{
int i,ok=1;
if(d[x])return ;
for(i=0;i<=9;i++)
{
if( ((x&(7<<i))>>i)==6 || ((x&(7<<i))>>i)==3)
{
ok=0;
dp(x^(7<<i));
d[x^(7<<i)]=1;
}
}
if(ok)res=min(calc(x),res);
}
int main() {
int t,num;
char ch;
scanf("%d",&t);
while(t--)
{
res=13;
num=0;
memset(d,0,sizeof(d));
for(int i=0;i<12;i++)
{
cin>>ch;
if(ch=='o')num=num*2+1;
else num*=2;
}
dp(num);
printf("%d\n",res);
}
return 0;
}