zoukankan      html  css  js  c++  java
  • Knight Moves(BFS,走’日‘字)

    Knight Moves

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 8831    Accepted Submission(s): 5202


    Problem Description
    A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
    Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.

    Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.
     
    Input
    The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.
     
    Output
    For each test case, print one line saying "To get from xx to yy takes n knight moves.".
     
    e2 e4 //起点 终点
    a1 b2
    b2 c3
    a1 h8
    a1 h7
    h8 a1
    b1 c3
    f6 f6

    Sample Output
    To get from e2 to e4 takes 2 knight moves.
    To get from a1 to b2 takes 4 knight moves.
    To get from b2 to c3 takes 2 knight moves.
    To get from a1 to h8 takes 6 knight moves.
    To get from a1 to h7 takes 5 knight moves.
    To get from h8 to a1 takes 6 knight moves.
    To get from b1 to c3 takes 1 knight moves.
    To get from f6 to f6 takes 0 knight moves.

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <queue>
     4 #include <cstring>
     5 using namespace std;
     6 int dx[]={1,-1,1,-1,2,-2,2,-2};
     7 int dy[]={2,-2,-2,2,1,-1,-1,1};
     8 int vis[9][9];
     9 struct point
    10 {
    11     int x;
    12     int y;
    13     int t;
    14 }st,tem,nex;
    15 int sx,sy,ex,ey,tim;
    16 char a,b,c,d;
    17 void bfs()
    18 {
    19     queue<point> s;
    20     st.x=sx,st.y=sy;
    21     st.t=0;
    22     s.push(st);
    23     memset(vis,0,sizeof(vis));
    24     while(!s.empty())
    25     {
    26         tem=s.front();
    27         s.pop();
    28 
    29         if(tem.x==ex&&tem.y==ey)
    30         {
    31             tim=tem.t;
    32             return;
    33         }
    34         if(vis[tem.x][tem.y]||tem.x<=0||tem.y<=0||tem.x>8||tem.y>8)
    35             continue;
    36         vis[tem.x][tem.y]=1;
    37         for(int i=0;i<8;i++)
    38         {
    39             int nx=tem.x+dx[i];
    40             int ny=tem.y+dy[i];
    41             int nt=tem.t+1;
    42             nex.x=nx,nex.y=ny,nex.t=nt;
    43             s.push(nex);
    44         }
    45     }
    46 }
    47 int main()
    48 {
    49     freopen("in.txt","r",stdin);
    50     while(scanf("%c%c %c%c",&a,&b,&c,&d)!=EOF)
    51     {
    52         getchar();
    53         tim=0;
    54         sy=a-'a'+1,sx=b-'0';
    55         ey=c-'a'+1,ex=d-'0';
    56         bfs();
    57         printf("To get from %c%c to %c%c takes %d knight moves.
    ",a,b,c,d,tim);
    58     }
    59 }
     
  • 相关阅读:
    Win7操作系统防火墙无法关闭的问题 无法找到防火墙关闭的地方的解决的方法
    【微信】微信获取TOKEN,以及储存TOKEN方法,Spring quartz让Token永只是期
    OC内存管理总结,清晰明了!
    下次自己主动登录(记住password)功能
    linux删除svn版本号库
    Python中可避免读写乱码的一个强慷慨法
    Tomcat源代码阅读#1:classloader初始化
    iOS关于图片点到像素转换之杂谈
    hdu 3804树链剖分+离线操作
    cdn缓存
  • 原文地址:https://www.cnblogs.com/a1225234/p/5036504.html
Copyright © 2011-2022 走看看