【POJ 2286】 The Rotation Game

【题目链接】

http://poj.org/problem?id=2286

【算法】

IDA*

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
const int A[] = {,,,,,,};
const int B[] = {,,,,,,};
const int C[] = {,,,,,,};
const int D[] = {,,,,,,};

int i,step;
int a[];
char path[];

inline void print()
{
        int i;
        for (i = ; i <= step; i++) printf("%c",path[i]);
        printf("\n%d\n",a[]);
}
inline int f()
{
        int i,m;
        int s[];
        memset(s,,sizeof(s));
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        s[a[]]++;
        m = ;
        for (i = ; i <= ; i++) m = max(m,s[i]);
        return  - m;
}
inline bool check()
{
        if (a[] == a[] && a[] == a[] && a[] == a[] && a[] == a[] && a[] == a[] && a[] == a[] && a[] == a[])
                return true;
        else return false;
}
inline bool IDDFS(int dep)
{
        int i,tmp;
        int b[];
        if (dep > step)
        {
                if (check())
                {
                        print();
                        return true;
                }
                else return false;
        }
        if (dep -  + f() > step) return false;
        for (i = ; i < ; i++) b[A[i]] = a[A[i]];
        path[dep] = 'A';
        tmp = a[A[]];
        for (i = ; i < ; i++) a[A[i]] = a[A[i+]];
        a[A[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[A[i]] = b[A[i]];
        for (i = ; i < ; i++) b[B[i]] = a[B[i]];
        path[dep] = 'B';
        tmp = a[B[]];
        for (i = ; i < ; i++) a[B[i]] = a[B[i+]];
        a[B[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[B[i]] = b[B[i]];
        for (i = ; i < ; i++) b[C[i]] = a[C[i]];
        path[dep] = 'C';
        tmp = a[C[]];
        for (i = ; i >= ; i--) a[C[i]] = a[C[i-]];
        a[C[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[C[i]] = b[C[i]];
        for (i = ; i < ; i++) b[D[i]] = a[D[i]];
        path[dep] = 'D';
        tmp = a[D[]];
        for (i = ; i >= ; i--) a[D[i]] = a[D[i-]];
        a[D[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[D[i]] = b[D[i]];
        for (i = ; i < ; i++) b[B[i]] = a[B[i]];
        path[dep] = 'E';
        tmp = a[B[]];
        for (i = ; i >= ; i--) a[B[i]] = a[B[i-]];
        a[B[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[B[i]] = b[B[i]];
        for (i = ; i < ; i++) b[A[i]] = a[A[i]];
        path[dep] = 'F';
        tmp = a[A[]];
        for (i = ; i >= ; i--) a[A[i]] = a[A[i-]];
        a[A[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[A[i]] = b[A[i]];
        for (i = ; i < ; i++) b[D[i]] = a[D[i]];
        path[dep] = 'G';
        tmp = a[D[]];
        for (i = ; i < ; i++) a[D[i]] = a[D[i+]];
        a[D[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[D[i]] = b[D[i]];
        for (i = ; i < ; i++) b[C[i]] = a[C[i]];
        path[dep] = 'H';
        tmp = a[C[]];
        for (i = ; i < ; i++) a[C[i]] = a[C[i+]];
        a[C[]] = tmp;
        if (IDDFS(dep+))
                return true;
        for (i = ; i < ; i++) a[C[i]] = b[C[i]];
        return false;
} 

int main()
{

        while (scanf("%d",&a[]) && a[])
        {
                for (i = ; i <= ; i++) scanf("%d",&a[i]);
                if (check())
                {
                        printf("No moves needed\n");
                        printf("%d\n",a[]);
                        continue;
                }
                for (i = ; i <= ; i++)
                {
                        step = i;
                        if (IDDFS()) break;
                }
        }

        return ;

}