HDU 4801 Pocket Cube

题目链接

去年现场，虎哥1Y的，现在刷刷题，找找状态...

一共6种转法，把3个面放到顶部，左旋和右旋，感觉写的还不错....都写成常数了。

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <queue>
#include <algorithm>
#define LL long long
using namespace std;
struct node
{
    int num[];
    int st;
};
int dr[] = {,,,,,,,,,,,};
int dc[] = {,,,,,,,,,,,};
int a[] = {,,,,,,,,,,,};
int b[] = {,,,,,,,,,,,};
int c[] = {,,,,,,,,,,,};
int aim[][] = {
                {,,,},
                {,,,},
                {,,,},
                {,,,},
                {,,,},
                {,,,}
                };
int judge(int *p)
{
    int ans = ,i,j;
    for(i = ;i < ;i ++)
    {
        for(j = ;j < ;j ++)
        {
            if(p[aim[i][j]] != p[aim[i][]])
            break;
        }
        if(j == ) ans ++;
    }
    return ans;
}
int main()
{
    node u,v;
    int n,i,ans;
    while(scanf("%d",&n)!=EOF)
    {
        for(i = ;i < ;i ++)
        {
            scanf("%d",&u.num[i]);
        }
        u.st = ;
        queue<node>que;
        que.push(u);
        ans = ;
        while(!que.empty())
        {
            u = que.front();
            que.pop();
            if(ans == ) break;
            ans = max(ans,judge(u.num));
            if(u.st == n) continue;
            v.st = u.st + ;
            //a
            for(i = ;i < ;i ++)
            {
                v.num[i] = u.num[i];
            }
            for(i = ;i < ;i ++)
            {
                v.num[a[dr[i]]] = u.num[a[i]];
            }
            que.push(v);
            for(i = ;i < ;i ++)
            {
                v.num[a[dc[i]]] = u.num[a[i]];
            }
            que.push(v);
            //b
            for(i = ;i < ;i ++)
            {
                v.num[i] = u.num[i];
            }
            for(i = ;i < ;i ++)
            {
                v.num[b[dr[i]]] = u.num[b[i]];
            }
            que.push(v);
            for(i = ;i < ;i ++)
            {
                v.num[b[dc[i]]] = u.num[b[i]];
            }
            que.push(v);
            //c
            for(i = ;i < ;i ++)
            {
                v.num[i] = u.num[i];
            }
            for(i = ;i < ;i ++)
            {
                v.num[c[dr[i]]] = u.num[c[i]];
            }
            que.push(v);
            for(i = ;i < ;i ++)
            {
                v.num[c[dc[i]]] = u.num[c[i]];
            }
            que.push(v);
        }
        printf("%d\n",ans);
    }
    return ;
}