中南大学OJ 1046 追杀

OJ

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
#define N 100005
#define M 105
#define Mod 1000
#define Inf 0x7fffffff

struct P
{
	int x,y;
	int time;
};
P s,em;
queue<P> G;
queue<P> GG;
int dist[8][2] = {2,1,2,-1,1,2,1,-2,-2,1,-2,-1,-1,2,-1,-2};
int dx,dy;
int maps[10][10];
int emper[10][10];
int minx = Inf;

//刚开始也尝试过两个队列同时的，但是经常走重复的，所以效率太低，也容易爆栈！后面还放了先把国王走的不重复的时间记下来
//再马去找，调试的时候发现国王很快就会遇到他原来走过的地方，而这其实会影响结果的！
//其实再换过来想，先把马的找出来，然后国王再走，同时注意一点，国王到某个点的时间如果小于马到这个点的时间，那这个点是不可能追到
//的，而能追到则必须国王的时间大于等于马到这个点的时间，而根据一般的数学或者理解也可以知道，它们的时间差应该是2的倍数，不然追不到
//这实际上就是走出去又走回来的要用两步的缘故吧！
void reinit()
{
	while(!G.empty()) G.pop();
	while(!GG.empty()) GG.pop();
	memset(maps,-1,sizeof(maps));
	memset(emper,-1,sizeof(emper));
	minx = Inf;
}
bool is(int x,int y)
{
	if(x<0 ||y<0 ||x>8 ||y>7) return false;
	return true;
}
void bfs()
{
	GG.push(em);
	dx = 1;
	dy = 1;
	emper[em.y][em.x]=0;
	while(!GG.empty())
	{
		P a = GG.front();GG.pop();
		P te;
		if(a.time>=maps[a.y][a.x] && (a.time-maps[a.y][a.x])%2==0)
			{minx = a.time;return ;}

		if(a.x == 0 && a.y == 0) //反射方向弄错了，花了我好多时间！现在代码就显得冗长了！
		{   
			if(dx == -1 && dy ==-1)
			dx = 1,dy =1;
			else if(dx == -1 && dy ==1)
				dx = -dx;
			else if(dx == 1&&dy == 1)
				;
			else dy =-dy;

		}
		else if(a.x==8 && a.y == 0 )
		{
			if(dx == -1 && dy ==-1)
			   dy=-dy;
			else if(dx == -1 && dy ==1)
				;
			else if(dx == 1&&dy == 1)
				dx=-dx;
			else dx=-dx,dy=-dy;
		}

		else if(a.x == 0 && a.y == 7)
		{
			if(dx == -1 && dy ==-1)
			  dx = -dx;
			else if(dx == -1 && dy ==1)
				dx=-dx,dy=-dy;
			else if(dx == 1&&dy == 1)
				dy=-dy;
			else;
		}
		else if(a.x == 8 &&a.y == 7) 
		{
			if(dx == -1 && dy ==-1)
			;
			else if(dx == -1 && dy ==1)
				dy=-dy;
			else if(dx == 1&&dy == 1)
				dx=-dx,dy=-dy;
			else dx=-dx;
		}
		else if(a.x == 8 ) dx = -dx;
		else if(a.x == 0 &&a.time !=0) dx=-dx;
		else if(a.y == 7) dy=-dy;
		else if(a.y==0 && a.time !=0) dy=-dy;
		te.x = a.x + dx;
		te.y = a.y + dy;
		te.time = a.time +1;
		emper[te.y][te.x]= te.time;
		GG.push(te);
	}
}
void rebfs()
{
	G.push(s);
	maps[s.y][s.x]=0;
	while(!G.empty())
	{
		P b = G.front();
		G.pop();
		for(int i=0;i<8;i++)
		{
				P te;
				te.x = b.x + dist[i][0];
				te.y = b.y + dist[i][1];
				te.time = b.time+1;
				if(is(te.x,te.y) && maps[te.y][te.x] == -1)
				{
					maps[te.y][te.x] = te.time;
					G.push(te);
				}
		}	
	}
}
void init()
{
	while(scanf("%d%d%d%d",&s.x,&s.y,&em.x,&em.y)!=EOF)
	{
		reinit();
		s.time = 0;
		em.time = 0;

		rebfs();
		bfs();
		PR(minx);
	}
	return ;
}

int main()
{
	init();
	return 0;
}