zoukankan      html  css  js  c++  java
  • 杭电 1372 Knight Moves

    Knight Moves

    Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
    Total Submission(s) : 3 Accepted Submission(s) : 3
    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.”.

    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<iostream>
    #include<algorithm>
    #include<queue>
    #include<cstring>
    #include<cstdio>
    using namespace std;
    struct node
    {
        int x,y;
        int num;
    }as,t,h,x1;
    int h1,h2;
    int dir[8][2]={{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2},{-1,-2},{-2,-1}};
    int n,m,a[10][10];
    char a1[10],a2[10];
    int dfs()
    {
        queue<node>q;
        q.push(h);
        while(!q.empty())
        {
            t=q.front();
            q.pop();
            if(t.x==h1&&t.y==h2)
            {
                return t.num;
            }
            for(int i=0;i<8;i++)
            {
                x1.x=t.x+dir[i][0];
                x1.y=t.y+dir[i][1];
                x1.num=t.num+1;
                if(x1.x>=1&&x1.x<=8&&x1.y>=1&&x1.y<=8)
                    q.push(x1);
            }
        }
    }
    int main()
    {
        while(scanf("%s %s",&a1,&a2)!=EOF)
        {
            h.x=a1[0]-'a'+1;
            h.y=a1[1]-'0';
            h.num=0;
            h1=a2[0]-'a'+1;
            h2=a2[1]-'0';
            printf("To get from %s to %s takes %d knight moves.
    ",a1,a2,dfs());
        }
        return 0;
    }
    
  • 相关阅读:
    1012 The Best Rank (25 分)(排序)
    1011. World Cup Betting (20)(查找元素)
    1009 Product of Polynomials (25 分)(模拟)
    1008 Elevator (20 分)(数学问题)
    1006 Sign In and Sign Out (25 分)(查找元素)
    1005 Spell It Right (20 分)(字符串处理)
    Kafka Connect 出现ERROR Failed to flush WorkerSourceTask{id=local-file-source-0}, timed out while wait
    flume、kafka、avro组成的消息系统
    Java23种设计模式总结【转载】
    Java编程 思维导图
  • 原文地址:https://www.cnblogs.com/nanfenggu/p/7900184.html
Copyright © 2011-2022 走看看