题目：
This is a very popular game for children. In this game, there's a cube, which consists of 3 * 3 * 3 small cubes. We can unwrap the cube, it will become like this:
w w w
w w w
w w w
r r r g g g b b b o o o
r r r g g g b b b o o o
r r r g g g b b b o o o
y y y
y y y
y y y
The letters means the color on the small cubes. For example, 'r' means red, 'g' means green, 'y' means yellow....The goal for this game is to rotate the faces of the cube to make each of the faces contains only one color. Note there're exact 6 kind of colors on the cube and there're exact 9 small rectangles totally in any time in the game.
Do you know how to rotate the faces? I think most of you have known it. But I would like to show it again. When a face is rotated, the configuration of colors in all the adjacent faces changes. For the cube above, after we rotate the green face clock-wise, the last line of 'w' face will become the left column of 'b' face, the left column of 'b' face will become the top line of 'y' face, etc. As you may know, reaching the final position from a scrambled configuration can be quite challenging.
In this problem, you are given a configuration of the cube, and asked to give a way to reach the final position. To reduce the difficulty, the steps required will never be greater than 5.
输入：
The input contains an integer in the first line, which indicates the number of the test cases. In each test case, there're exact 10 lines. The first line is an empty line. The next 9 lines contain a configuration. The format can be seen in the sample input. For simplicity, we give an index to each face as follows:
/---\
| |
| 4 |
| |
/---+---+---+---\
| | | | |
| 0 | 1 | 2 | 3 |
| | | | |
\---+---+---+---/
| |
| 5 |
| |
\---/
Note that there's a space between two adjacent letters.
输出：
For each test case, the first line of the output is the smallest count N of the steps to reach the winning position. If the winning position can't be reached in 5 steps, print -1 in this line. Otherwise print each step in one line in the following N lines. A step contains two integers, the first one means the face index, and the second one means the direction. 1 means clock-wise and -1 means counter clock-wise. If the given position is the winning position, print 0 for such test case simply. If there're multiple solutions, any one is acceptable.
样例：
分析：我。。。自闭了两天竟然是没有写>5输出-1(°ཀ°)，为什么我会默认测试点必然可以在5步内实现啊(#`Д´)ﾉ
只能说这个模拟太恶心了！！！
用IDA*优化，思路是计算每一个面有几个和中心方格颜色不一样的方格，6个面的总数除12并向上取整是最少剩余需要的步数（如果最理想的情况加上已走步数仍然大于5那肯定没戏啊）
模拟写得相当丑(灬ºωº灬)
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<numeric>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<cctype>
#define PI acos(-1.0)
const int INF = 0x3f3f3f3f;
const int NINF = -INF - ;
typedef long long ll;
using namespace std;
char cube[][];
struct node
{
char maze[][];
};
struct cur
{
char maze[][];
};
node clockwise(node temp)
{
char gtm[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
memcpy(temp.maze, gtm, sizeof(temp.maze));
return temp;
}
node cclockwise(node temp)
{
char gtm[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
memcpy(temp.maze, gtm, sizeof(temp.maze));
return temp;
}
int bol, ans;
pair<int, int> P[];
void print()
{
for (int i = ; i < ans; ++i)
cout << P[i].first << ' ' << P[i].second << endl;
}
int hx(cur trans)
{
double sum = ;
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
return ceil(sum / );
}
void dfs(int rec, char pos[][], int deep)
{
if (rec > deep) return;
cur trans;
memcpy(trans.maze, pos, sizeof(trans.maze));
int h = hx(trans);
//cout << "test:" << h << endl;
if (h == )
{
ans = rec;
cout << rec << endl;
bol = ;
return;
}
if (h + rec > deep) return;
for (int i = ; i < ; ++i)
{
char tmp[][];
memcpy(tmp, pos, sizeof(tmp));
/*for (int j = 0; j < 9; ++j)
cout << tmp[j] << endl;
return;*/
node temp;
if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
/*for (int m = 0; m < 3; ++m)
{
for (int n = 0; n < 3; ++n)
cout << temp.maze[m][n] << ' ';
cout << endl;
}*/
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
/*if (i == 1 && deep == 2)
{
cout << "first" << endl;
for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
}
if (i == 2 && deep == 2)
{
cout << "second" << endl;
for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
}*/
dfs(rec + , tmp, deep);
//if (i == 1) return;
if (bol)
{
P[rec].first = i / ;
if (i % == ) P[rec].second = ;
else P[rec].second = -;
return;
}
}
}
int main()
{
int T;
cin >> T;
while (T--)
{
string nul;
getline(cin, nul);
for (int i = ; i < ; ++i)
{
char ss;
int num = ;
while ((ss = getchar()) != '\n')
{
if (ss != ' ') cube[i][num++] = ss;
else cube[i][num++] = ' ';
}
cube[i][num] = '\0';
}
/*for (int i = 0; i < 9; ++i)
cout << cube[i] << endl;*/
/*for (int i = 0; i < 3; ++i)
{
for (int j = 6; j < 11; j += 2)
{
cout << cube[i][j] << ' ';
}
cout << endl;
}*/
/*cur gat;
memcpy(gat.maze, cube, sizeof(gat.maze));
int p = judge(gat);
cout << p << endl;*/
bol = , ans = ;
for (int i = ; i <= ; ++i)
{
//cout << "deep:" << i << endl;
dfs(, cube, i);
if (bol)
{
print();
break;
}
}
if (!bol) cout << - << endl;
}
return ;
}