【kuangbin专题题目】HDU 1043 Eight

题目来源

【kuangbin专题题目】HDU 1043 Eight

题目思路

八数码题目，这题有多组输入，所以运用bfs + hash打表，循环时直接输出即可。

代码

#include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<unordered_map>
using namespace std;

#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR(i, a, b) for (int i = (a); i >= (b); --i)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> IntVec;

const int N = 1000 + 10;
string s(9, 0), END = "12345678x";
unordered_map<string, string> vis;
int dx[] = { -1, 1, 0, 0}, dy[] = {0, 0 ,-1, 1 };
char dir[] = { "durl" };

void bfs()
{
	queue<string> q;
	q.push(END);

	while(!q.empty())
	{
		string t = q.front();
		q.pop();

		int u = t.find('x');
		int x = u / 3, y = u % 3;
		string dist = vis[t];
		
		_for (i, 0, 4)
		{
			int a = x + dx[i], b = y + dy[i];
			if (0 <= a && a < 3 && 0 <= b && b < 3)
			{
				swap(t[u], t[a * 3 + b]);
				if (!vis.count(t))
				{
					vis[t] = dist + dir[i];
					q.push(t);
				}
				swap(t[u], t[a * 3 + b]);
			}
		}
	}
}

int main()
{
#ifdef LOCAL
	freopen("data.in", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin.tie(0);

	bfs();
	while(cin>> s[0])
	{
		_for(i, 1, 9) cin >> s[i];
		if (vis.count(s))
		{
			string ans = vis[s];
			reverse(ans.begin(), ans.end());
			cout << ans << endl;
		}
		else puts("unsolvable");
	}
	return 0;
}