DBFS POJ1198 Solitaire

题意：给出一个初始局面和目标局面，每个局面有四个棋子，每进行一步操作可以将一个棋子向四个方向走一格，如果某个方向已经有与它相邻的棋子，则可以跳过这个棋子到下一个空格，求能否在8步之内得到目标局面。

思路：压缩状态判重，注意棋子是无序的

<span style="font-size:12px;">#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <algorithm>
#define For(i,j,k) for(int i = j;i <= k;i ++)

const int N = 20000010, d[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
using namespace std;

short vis[N], dep[N];
struct Node{
	int x[5], y[5];
	short ty;
	int id(){
		int sx[5];
		For(i,1,4)sx[i] = (x[i] - 1) * 8 + y[i] - 1;
		sort(sx + 1, sx + 5);
		int k = 0;
		For(i,1,4)
			k = k * 64 + sx[i];
		return k;
	}
}st, ed;

bool ok(Node& c, int t){
	For(i,1,4)
		if(i != t && c.x[i] == c.x[t] && c.y[i] == c.y[t])
			return 0;
	return c.x[t] <= 8 && c.x[t] >= 1 && c.y[t] <= 8 && c.y[t] >= 1;
}

bool DBFS(){
	if(st.id() == ed.id())return 1;
	queue<Node> q;
	st.ty = 1, ed.ty = -1;
	q.push(st), q.push(ed);
	vis[st.id()] = 1;
	vis[ed.id()] = -1;
	while(!q.empty()){
		Node s = q.front();q.pop();
		int D = dep[s.id()];
		if(D >= 4)return 0;
		For(i,1,4)
			For(j,0,3){
				Node tmp = s;
				tmp.x[i] = s.x[i] + d[j][0], tmp.y[i] = s.y[i] + d[j][1];
				For(k,1,4)
					if(i != k && tmp.x[i] == tmp.x[k] && tmp.y[i] == tmp.y[k]){
						tmp.x[i] += d[j][0], tmp.y[i] += d[j][1];
						break;
					}
				int c = tmp.id();
				if(ok(tmp, i)){
					if(vis[c] + s.ty == 0 && D + dep[c] < 8)
						return 1;
					if(!vis[c]){
						vis[c] = tmp.ty;
						dep[c] = D + 1;
						q.push(tmp);
					}
				}
			}
	}
	return 0;
}

int main(){
	For(i,1,4)
		scanf("%d%d", &st.x[i], &st.y[i]);
	For(i,1,4)
		scanf("%d%d", &ed.x[i], &ed.y[i]);
	puts(st.id() == ed.id() || DBFS() ? "YES" : "NO");
	return 0;
}</span>