UVA 704 Colour Hash (双向bfs + 判重）

Colour Hash

This puzzle consists of two wheels. Both wheels can rotate both clock and counter-clockwise. They contain 21 coloured pieces, 10 of which are rounded triangles and 11 of which are separators. Figure 1 shows the final position of each one of the pieces. Note that to perform a one step rotation you must turn the wheel until you have advanced a triangle and a separator.

Figure 1. Final puzzle configuration

Your job is to write a program that reads the puzzle configuration and prints the minimum sequence of movements required to reach the final position. We will use the following integer values to encode each type of piece:

0	grey separator
1	yellow triangle
2	yellow separator
3	cyan triangle
4	cyan separator
5	violet triangle
6	violet separator
7	green triangle
8	green separator
9	red triangle
10	red separator

A puzzle configuration will be described using 24 integers, the first 12 to describe the left wheel configuration and the last 12 for the right wheel. The first integer represents the bottom right separator of the left wheel and the next eleven integers describe the left wheel clockwise. The thirteenth integer represents the bottom left separator of right wheel and the next eleven integers describe the right wheel counter-clockwise.

The final position is therefore encoded like:

0 3 4 3 0 5 6 5 0 1 2 1 0 7 8 7 0 9 10 9 0 1 2 1

If for instance we rotate the left wheel clockwise one position from the final configuration (as shown in Figure 2) the puzzle configuration would be encoded like:

2 1 0 3 4 3 0 5 6 5 0 1 0 7 8 7 0 9 10 9 0 5 0 1

Figure 2. The puzzle after rotating the left wheel on step clockwise from the final configuration.

Input 

Input for your program consists of several puzzles. The first line of the input will contain an integer n specifying the number of puzzles. There will then be n lines each containing 24 integers separated with one white space, describing the initial puzzle configuration as explained above.

Output 

For each configuration your program should output one line with just one number representing the solution. Each movement is encoded using one digit from 1 to 4 in the following way:

1	Left Wheel Clockwise rotation
2	Right Wheel Clockwise rotation
3	Left Wheel Counter-Clockwise rotation
4	Right Wheel Counter-Clockwise rotation

No space should be printed between each digit. Since multiple solutions could be found, you should print the solution that is encoded as the smallest number. The solution will never require more than 16 movements.

If no solution is found you should print ``NO SOLUTION WAS FOUND IN 16 STEPS". If you are given the final position you should print ``PUZZLE ALREADY SOLVED".

Sample Input 

3
0 3 4 3 0 5 6 5 0 1 2 1 0 7 8 7 0 9 10 9 0 1 2 1
0 3 4 5 0 3 6 5 0 1 2 1 0 7 8 7 0 9 10 9 0 1 2 1
0 9 4 3 0 5 6 5 0 1 2 1 0 7 8 7 0 9 10 3 0 1 2 1

Sample Output 

PUZZLE ALREADY SOLVED
1434332334332323
NO SOLUTION WAS FOUND IN 16 STEPS

题意:给定一个状态。要转到0343056501210787091090121这个状态。求最少转的步骤。。如果超过16步不记。如果第一步就成功了就直接输出PUZZLE ALREADY SOLVED。

思路：双向BFS。从终点状态往前转8步。记录下这些状态。然后从起点往后转8步。看8步内能不能出现其中的状态。如果可以就是可以转出。最后输出的时候要注意。由于从终点往前转的全部都是逆过来的。输出全部要逆过来（包括顺序和顺逆时针)..

代码：

#include <stdio.h>
#include <string.h>
#include <string>
#include <map>
#include <queue>
#include <iostream>
using namespace std;

int t;
int judge;
char pu[30];
char start[30] = "034305650121078709:90121";
struct QUE {
    char status[30];
    char step[30];
    int stepnum;
} q, p;
map<string, string> vis;
map<string, int> viss;
queue<QUE> Q;

void zhuan(int way) {
    if (way == 1) {
	char sb1 = q.status[10];
	char sb2 = q.status[11];
	for (int i = 11; i >= 2; i --)
	    q.status[i] = q.status[i - 2];
	q.status[1] = sb2; q.status[0] = sb1;
	q.status[23] = q.status[11]; 
	q.status[22] = q.status[10];
	q.status[21] = q.status[9];
    }
    if (way == 3) {
	char sb1 = q.status[0];
	char sb2 = q.status[1];
	for (int i = 0; i < 10; i ++)
	    q.status[i] = q.status[i + 2];
	q.status[11] = sb2; q.status[10] = sb1;
	q.status[23] = q.status[11]; 
	q.status[22] = q.status[10];
	q.status[21] = q.status[9];
    }
    if (way == 4) {
	char sb1 = q.status[22];
	char sb2 = q.status[23];
	for (int i = 23; i >= 12; i --)
	    q.status[i] = q.status[i - 2];
	q.status[13] = sb2; q.status[12] = sb1;
	q.status[11] = q.status[23]; 
	q.status[10] = q.status[22];
	q.status[9] = q.status[21];

    }
    if (way == 2) {
	char sb1 = q.status[12];
	char sb2 = q.status[13];
	for (int i = 12; i < 22; i ++)
	    q.status[i] = q.status[i + 2];
	q.status[23] = sb2; q.status[22] = sb1;
	q.status[11] = q.status[23]; 
	q.status[10] = q.status[22];
	q.status[9] = q.status[21];

    }
}
void bfs(char *a) {
    vis.clear();
    while (!Q.empty()) {Q.pop();}
    strcpy(q.status, a); q.stepnum = 0; q.step[0] = '\0';
    vis[q.status] = "sb";
    Q.push(q);
    while (!Q.empty()) {
	p = Q.front();
	Q.pop();
	for (int i = 1; i <= 4; i ++) {
	    q = p;
	    zhuan(i);
	    if (vis[q.status] == "") {
		q.step[q.stepnum ++] = i + '0';
		q.step[q.stepnum] = '\0';
		vis[q.status] = q.step;
		Q.push(q);
	    }
	}
	if (p.stepnum == 8)
	    return;	    
    }
}

void bfs2(char *a) {
    viss.clear();
    while (!Q.empty()) {Q.pop();}
    strcpy(q.status, a); q.stepnum = 0; q.step[0] = '\0';
    viss[q.status] = 1;
    Q.push(q);
    while (!Q.empty()) {
	p = Q.front();
	if (vis[p.status] != "") {
	    judge = 1;
	    return;
	}
	Q.pop();
	for (int i = 1; i <= 4; i ++) {
	    q = p;
	    zhuan(i);
	    if (viss[q.status] == 0) {
		q.step[q.stepnum ++] = i + '0';
		q.step[q.stepnum] = '\0';
		viss[q.status] = 1;
		Q.push(q);
	    }
	}
	if (p.stepnum == 9)
	    return;
    }
}

int main() {
    scanf("%d%*c", &t);
    while (t --) {
	int piece;
	judge = 0;
	for (int i = 0; i < 24; i ++) {
	    scanf("%d", &piece);
	    pu[i] = '0' + piece;
	}
	pu[24] = '\0';
	if (strcmp(pu, start) == 0) {
	    printf("PUZZLE ALREADY SOLVED\n");
	    continue;
	}
	bfs(start);
	bfs2(pu);
	if (judge) {
	    printf("%s", p.step);
	    for (int i = vis[p.status].size() - 1; i >= 0; i --) {
		if (vis[p.status][i] == '1') printf("3");
		if (vis[p.status][i] == '2') printf("4");
		if (vis[p.status][i] == '3') printf("1");
		if (vis[p.status][i] == '4') printf("2");
	    }
	    printf("\n");
	}
	else printf("NO SOLUTION WAS FOUND IN 16 STEPS\n");
    }
    return 0;
}