zoukankan      html  css  js  c++  java
  • hdu 1372Knight Moves



    E - Knight Moves
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    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.". 

    Sample Input

    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.

    #include<stdio.h>
    #include<math.h>
    #include<stdlib.h>
    #include<string.h>
    #include<algorithm>
    #include<queue>
    #include<stack>
    #include<iostream>
    
    using namespace std;
    
    
    int startx,starty,endx,endy;
    char a[3],c[3];
    int b[100][100];
    
    int dir[8][2]= {1,2,2,1,2,-1,1,-2,-1,-2,-2,-1,-2,1,-1,2};//往八个方向搜
    
    struct node
    {
        int x,y,step;
    };
    
    void bfs(int x,int y)
    {
        node st,ed;
        memset(b,0,sizeof(b));
        queue<node>q;
        st.x=x;
        st.y=y;
        st.step=0;
        b[st.x][st.y]=1;
        q.push(st);
        while(!q.empty())
        {
            st=q.front();
            q.pop();
            if(st.x==endx&&st.y==endy)
            {
                printf("To get from %s to %s takes %d knight moves.
    ",a,c,st.step);
                return;
            }
            for(int k=0; k<8; k++)
            {
                ed.x=st.x+dir[k][0];
                ed.y=st.y+dir[k][1];
                if(ed.x>=1&&ed.x<=8&&ed.y>=1&&ed.y<=8&&!b[ed.x][ed.y])
                {
                    b[ed.x][ed.y]=1;
                    ed.step=st.step+1;
                    q.push(ed);
                }
            }
        }
    }
    
    int main()
    {
        while(~scanf("%s%s",a,c))
        {
            startx=a[0]-'a'+1;//把字母转化为数字模拟地图
            starty=a[1]-'0';
            endx=c[0]-'a'+1;
            endy=c[1]-'0';
            bfs(startx,starty);
        }
        return 0;
    }
    







    
  • 相关阅读:
    插件之基类窗体
    插件之类注册
    主控程序之主窗体
    主控程序、插件之间的接口声明
    XE2 LSUPER LITE安装提示item not found
    远程方法的定义和调用
    主控程序之插件装载器二
    插件之接口实现
    主控程序之插件装载器一
    sql工厂类
  • 原文地址:https://www.cnblogs.com/nyist-xsk/p/7264916.html
Copyright © 2011-2022 走看看