[UVA] The Rotation Game

题目:https://vjudge.net/problem/UVA-1343

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<vector>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<queue>
#pragma warning(disable:4996)
using namespace std;
/*
	  00    01
	  02    03
04 05 06 07 08 09 10
	  11    12
13 14 15 16 17 18 19
	  20    21
	  22    23
*/

int position[8][7] = {
						  {0,2,6,11,15,20,22},{1,3,8,12,17,21,23},  //八个方向格子的坐标值
						  {10,9,8,7,6,5,4},{19,18,17,16,15,14,13},
						  {23,21,17,12,8,3,1}, {22,20,15,11,6,2,0 },
						  {13,14, 15, 16, 17, 18, 19},{4,5,6,7,8,9,10}
};

int goal[8] = { 6,7,8,11,12,15,16,17 };

int a[25];
char order[30];

bool is_goal()
{
	for (int i = 0; i < 7; i++)
	{
		if (a[goal[i]] != a[goal[i + 1]])
			return false;
	}
	return true;
}

void rotate(int step)
{
	int t = a[position[step][0]];
	for (int i = 1; i < 7; i++)
	{
		a[position[step][i - 1]] = a[position[step][i]];
	}

	a[position[step][6]] = t;
	return;
}

int h()
{
	int cnt1 = 0, cnt2 = 0, cnt3 = 0;
	for (int i = 0; i < 8; i++)
	{
		if (a[goal[i]] == 1)
			cnt1++;
		else if (a[goal[i]] == 2)
			cnt2++;
		else if (a[goal[i]] == 3)
			cnt3++;
	}

	return 8 - max(max(cnt1, cnt2), cnt3);
}
bool dfs(int d, int maxd)
{
	if (is_goal()) return true;
	if (h() + d > maxd) return false;
	int temp[25];
	memcpy(temp, a,sizeof(a));
	for (int i = 0; i < 8; i++)
	{
		rotate(i);
		order[d] = i + 'A';
		if (dfs(d + 1, maxd))
			return true;
		memcpy(a, temp, sizeof(temp));
	}
	return false;
}
void solve()
{
	if (is_goal())
	{
		cout << "No moves needed" << endl << a[6] << endl;
		return;
	}
	for (int maxd = 1;; maxd++)
	{
		if (dfs(0, maxd))
		{
			order[maxd] = '\0';
			cout << order << endl << a[6] << endl;
			return;
		}
	}
	
}


int main()
{
	while (cin>>a[0] && a[0])
	{
		for (int i = 1; i < 24; i++)
		{
			cin >> a[i];
		}
		solve();
	}

	return 0;
}