Knight Moves_pku_1915(广搜).java

Description

Background 
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? 
The Problem 
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov. 
For people not familiar with chess, the possible knight moves are shown in Figure 1. 

Input

Output

Sample Input

3
8
0 0
7 0
100
0 0
30 50
10
1 1
1 1

Sample Output

5
28
0

/*
 * 用Map标记会超内存，。。。。广搜，数组标记
 * 
 */

import java.util.ArrayDeque;
//import java.util.HashMap;
//import java.util.Map;
import java.util.Queue;
import java.util.Scanner;

public class Main{
//	private static Map<String,Integer> map=new HashMap<String, Integer>();
	private static Queue<Point> queue=new ArrayDeque<Point>();
	private static int d[][]={{-2,-1},{-1,-2},{1,-2},{2,-1},{2,1},{1,2},{-1,2},{-2,1}};
	private static int ex,ey,n;
	private static boolean ok[][];
	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int N=input.nextInt();
		while(N-->0){
			n=input.nextInt();
			Init();
			int sx=input.nextInt();
			int sy=input.nextInt();
			ex=input.nextInt();
			ey=input.nextInt();
			Point p=new Point();
			p.setX(sx);
			p.setY(sy);
			p.setDp(0);
			queue.add(p);
			//map.put(sx+","+sy, 0);
			ok[sx][sy]=true;
			System.out.println(bfs(queue));
		}
	}
	private static Integer bfs(Queue<Point> q) {
		while(!q.isEmpty()){
			Point p=q.poll();
			if(p.getX()==ex&&p.getY()==ey){
				return p.getDp();
			}
			for(int i=0;i<8;++i){
				int x=p.getX()+d[i][0];
				int y=p.getY()+d[i][1];
				if(x<0||x>=n||y<0||y>=n){
					continue;
				}
				Point point=new Point();
				point.setX(x);
				point.setY(y);
				point.setDp(p.getDp()+1);
				if(!ok[x][y]){
					q.add(point);
					ok[x][y]=true;
				}
			}
		}
		return null;
	}
	private static void Init() {
		queue.clear();
		//map.clear();
		ok=new boolean[n][n];
	}
}
class Point{
	private Integer x,y,dp;
	public Integer getDp() {
		return dp;
	}
	public void setDp(Integer dp) {
		this.dp = dp;
	}
	public Integer getX() {
		return x;
	}
	public void setX(Integer x) {
		this.x = x;
	}
	public Integer getY() {
		return y;
	}
	public void setY(Integer y) {
		this.y = y;
	}
}