ZOJ-2477 Magic Cube

题目：

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2477

题意：

三阶魔方复原。

思路：

最多5步，所以暴力搜索就行了，主要是状态的记录和选装状态怎么写。然后IDA*慢慢深搜即可。

代码：

int n,m;
int flag,sum,res[10];
int row[6][8]={
    {0,1,2,3,5,6,7,8},{9,10,11,21,23,33,34,35},{12,13,14,24,26,36,37,38},
    {15,16,17,27,29,39,40,41},{18,19,20,30,32,42,43,44},{45,46,47,48,50,51,52,53}
};
int change[12][20]={
         {11,23,35,34,33,21,9,10,51,48,45,36,24,12,6,3,0,20,32,44},
         {9,10,11,23,35,34,33,21,36,24,12,6,3,0,20,32,44,51,48,45},
         {14,13,26,38,37,36,24,12,45,46,47,39,27,15,8,7,6,11,23,35},
         {12,24,13,14,26,38,37,36,39,27,15,8,7,6,11,23,35,45,46,47},
         {17,29,41,40,39,27,15,16,47,50,53,42,30,18,2,5,8,14,26,38},
         {15,16,17,29,41,40,39,27,42,30,18,2,5,8,14,26,38,47,50,53},
         {18,19,20,32,44,43,42,30,53,52,51,33,21,9,0,1,2,17,29,41},
         {42,30,18,19,20,32,44,43,33,21,9,0,1,2,17,29,41,53,52,51},
         {0,1,2,5,8,7,6,3,12,13,14,15,16,17,18,19,20,9,10,11},
         {6,3,0,1,2,5,8,7,15,16,17,18,19,20,9,10,11,12,13,14},
         {45,46,47,50,53,52,51,48,44,43,42,41,40,39,38,37,36,35,34,33},
         {51,48,45,46,47,50,53,52,41,40,39,38,37,36,35,34,33,44,43,42}
};
int cen[6]={4,22,25,28,31,49};
char s[11],c[60],ct[60];
int lenn(char *tmp)
{
    int ans=0;
    for(int i=0;i<6;i++)
    {
        int t=0;
        for(int j=0;j<8;j++)
            if(tmp[row[i][j]]!=tmp[cen[i]])
                t++;
        ans=max(ans,t);
    }
    return (ans+2)/3;
}
void IDAstar(int step, char a[], int fa)
{
    int t=lenn(a);
    if(step+t>sum) return;
    if(!t){flag=1;return;}
    char tmp[60];
    for(int i=0;i<12;i++)
    {
        if((fa^i)==1)continue;
        memcpy(tmp,a,60*sizeof(char));
        res[step]=i;
        for(int j=0;j<20;j++)
            tmp[change[i][j]] = a[change[i^1][j]];
        IDAstar(step+1,tmp,i);
        if(flag)return;
    }
}
int main()
{
    int i,j,k,kk,t,x,y,z;
    scanf("%d",&k);
    while(k--)
    {
        for(i=0;i<54;i++)
        {
            scanf("%s",s);
            c[i]=s[0];
        }
        flag=0;
        sum=lenn(c);
        while(sum<=5)
        {
            IDAstar(0,c,-1);
            if(flag)
            {
                printf("%d\n",sum);
                for(i=0;i<sum;i++)
                    printf("%d %d ",res[i]/2,(res[i]&1)?-1:1);
                if(sum)printf("\n");
                break;
            }
            sum++;
        }
        if(!flag)
            printf("-1\n");
    }
    return 0;
}