zoj 1091 Queue

最新推荐文章于 2019-07-14 07:24:39 发布

贫嘴小李子的幸福生活

最新推荐文章于 2019-07-14 07:24:39 发布

阅读量473

点赞数

分类专栏： Java足迹

本文链接：https://blog.csdn.net/u013491262/article/details/42581051

版权

Java足迹专栏收录该内容

272 篇文章 1 订阅

订阅专栏

zoj 1091

//package adt ;
import  java.lang.*; 

//import  adt.Animal ; 
import  java.util.*; 

class  Node{
	    public int x , y , step ;
	    Node(){}
	    Node(int x , int y , int step){
	  	  this.x = x ;
	  	  this.y = y ;
	  	  this.step = step ;
	    }
}

public class Main{

	 
	   public static Node S = new Node() , T = new Node() ;
	   public static boolean vis[][] = new boolean[10][10] ;
	   
	   public static int [][] d= {{1 , -2} , {1 , 2} , {-1 , -2} , {-1 , 2} ,
	                        {2 , 1} , {2 , -1} , {-2 , -1} , {-2 , 1} } ; 
	   
	   public static boolean cango(int x , int y){
		      return 1 <= x && x <= 8 && 1 <= y && y <= 8 ;
	   } 
	   
	   public static int bfs(){
		      Queue<Node> q = new LinkedList<Node>() ;      
		      Node now = new Node() ;
		      
		      for(int i = 1 ; i <= 8 ; i++){
		    	  for(int j = 1 ; j <= 8 ; j++) vis[i][j] = false ;
		      }
		      
		      vis[S.x][S.y] = false  ;
		      
		      q.add(S) ;
		      while(! q.isEmpty()){
		    	    now = q.poll() ;
		    	    if(now.x == T.x && now.y == T.y)  return now.step ;
		    	    for(int i = 0 ; i < d.length ; i++){
		    	    	  int x = now.x + d[i][0] ;
		    	    	  int y = now.y + d[i][1] ;
		    	          if(cango(x , y) && ! vis[x][y]){
		    	        	    vis[x][y] = true ;
		    	        	    q.add(new Node(x , y , now.step + 1)) ;
		    	          }	  
		    	    }
		      }
		      
		      return -1 ;
	   } 
	
	   public static void main(String srgs[]){      
	          
		      Scanner cin = new Scanner(System.in) ;
	          String  sa , sb ;
	        
	          while(cin.hasNext()){
	        	    sa = cin.next() ;
	        	    S.x = sa.charAt(0) - 'a' + 1 ;
	        	    S.y = sa.charAt(1) - '0' ;
	        
	        	    sb =  cin.next() ;
	        	    T.x = sb.charAt(0) - 'a' + 1 ;
	        	    T.y = sb.charAt(1) - '0' ;
	               
	        	    S.step = 0 ;
	        	    
	        	    System.out.printf("To get from %s to %s takes %d knight moves.\n", sa , sb , bfs() ) ;

	          }
	           
	   }
}