POJ 2697 A Board Game

我是直接用map 来判重的

#define fi freopen("in.txt","r",stdin)
#include <stdio.h>   
#include <iostream>
#include <string.h>   
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>   
#include <string>
using namespace std;
/*my_template*/
/*data type*/
typedef pair<int,int> pii;
typedef long long ll; typedef double dl;
typedef vector<pii> vii;
typedef set<pii> sii;
/*sim_operarion*/
#define sfint(x) scanf("%d",&x)
#define sfint2(x,y) scanf("%d%d",&x,&y)
#define sfint3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define sfstr(c) scanf("%s",c)
#define pfint(x) printf("%d\n",x)
#define fr(i,s,n) for(i=s;i<n;++i)
#define _fr(i,n,s) for(i=n-1;i>=s;--i)
#define cl(a) memset(a,0,sizeof(a))
/*bitmask*/
#define _ni(x) (1<<(x))
#define _niL(x) (1LL<<(x))
#define _has(s,x) ((s&(_ni(x)))!=0)
#define _hasL(s,x) ((s&(_niL(x)))!=0LL)
template<class T> inline T _lowbit(const int &x){ return (x^(x-1))&x; }  
template<class T> inline int _bitsize(const T &x){ return (x==0)?0:(1+_bitsize(x&(x-1))); }
/*CONST VALUE*/
const dl _pi=acos(-1.0);
const dl _eps=1e-6;
/*my_template*/

struct State{
	char s[17];
	int dep;
	char c;
}st,goal;

map<string,int> mp;
int d[8][2] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
State q[2000000];
int tot=0;
bool in(int x,int y){
	return x>=0&&x<4 && y>=0&&y<4;
}
int bfs(){
	int f=0,r=1,i,j,x,y,gox,goy,tmp;
	State  cur,nxt;
	st.dep = 0;q[0] = st;

	while(f!=r){
		cur = q[f++];
		fr(i , 0,16){
			if (cur.c == cur.s[i]){
				x = i/4;y = i%4;
				fr(j ,0,8){
					gox = x+d[j][0];
					goy = y+d[j][1];
					if (in(gox,goy) && cur.s[gox*4+goy] == '*'){
						while( in(gox,goy) && cur.s[gox*4+goy] == '*'){
							gox+=d[j][0];
							goy+=d[j][1];
						}
						gox -= d[j][0];goy-=d[j][1];
						nxt = cur;
						swap(nxt.s[x*4+y],nxt.s[gox*4+goy]);
						if (cur.c == 'w') nxt.c='b';else nxt.c='w';
						tmp = mp[nxt.s];
						if (tmp == 0 ){
							nxt.dep++;
							mp[nxt.s] = tot++;
							q[r++] = nxt;
						}
						else if (tmp ==1){
							return nxt.dep+1;
						}
					}
				}
			}
		}
	}
	return -1;
}
void solve(){
	tot=2;mp[goal.s] = 1;
	mp[st.s] = tot++;
	st.c = 'w';
	int ans = bfs();
	printf("%d\n",ans);
}
int main(){
	int T;
	sfint(T);
	while(T--){
		sfstr(st.s);sfstr((st.s+4));sfstr((st.s+8));sfstr((st.s+12));
		sfstr(goal.s);sfstr((goal.s+4));sfstr((goal.s+8));sfstr((goal.s+12));
		solve();
	}
	return 0;
}