zoukankan      html  css  js  c++  java
  • Shortest path of the king

    Shortest path of the king
    time limit per test
    1 second
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square t. As the king is not in habit of wasting his time, he wants to get from his current position s to square t in the least number of moves. Help him to do this.

    In one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).

    Input

    The first line contains the chessboard coordinates of square s, the second line — of square t.

    Chessboard coordinates consist of two characters, the first one is a lowercase Latin letter (from a to h), the second one is a digit from 1to 8.

    Output

    In the first line print n — minimum number of the king's moves. Then in n lines print the moves themselves. Each move is described with one of the 8: L, R, U, D, LU, LD, RU or RD.

    L, R, U, D stand respectively for moves left, right, up and down (according to the picture), and 2-letter combinations stand for diagonal moves. If the answer is not unique, print any of them.

    Examples
    input
    a8
    h1
    output
    7
    RD
    RD
    RD
    RD
    RD
    RD
    RD
    #include<iostream>
    #include<stdio.h>
    #include<queue>
    #include<cstring>
    using namespace std;
    struct Node
    {
        char x;
        int y;
    } s,e;
    int main()
    {
        scanf("%c%d
    %c%d",&s.x,&s.y,&e.x,&e.y);
        int startx=s.x-'a';
        int endx=e.x-'a';
        int dx=endx-startx;
        int dy=e.y-s.y;
        int ma=max(abs(dx),abs(dy));
        int mi=min(abs(dx),abs(dy));
        if(dx>=0&&dy>=0)
        {
            printf("%d
    ",ma);
            for(int i=0;i<mi;i++) printf("RU
    ");
            for(int i=mi;i<ma;i++)
                printf("%c
    ",dx==ma?'R':'U');
        }
        else if(dx<0&&dy<0)
        {
            dx*=-1;
            dy*=-1;
            printf("%d
    ",ma);
            for(int i=0;i<mi;i++)
                printf("LD
    ");
            for(int i=mi;i<ma;i++)
                printf("%c
    ",dx==ma?'L':'D');
        }
        else if(dx>=0&&dy<0)
        {
            dy*=-1;
            printf("%d
    ",ma);
            for(int i=0;i<mi;i++)
                printf("RD
    ");
            for(int i=mi;i<ma;i++)
                printf("%c
    ",dx==ma?'R':'D');
        }
        else if(dx<0&&dy>=0)
        {
            dx*=-1;
            printf("%d
    ",ma);
            for(int i=0;i<mi;i++)
                printf("LU
    ");
            for(int i=mi;i<ma;i++)
                printf("%c
    ",dx==ma?'L':'U');
        }
        return 0;
    }
    View Code
  • 相关阅读:
    吴恩达《深度学习》第四门课(3)目标检测(Object detection)
    cnn知识点汇总
    吴恩达《深度学习》第四门课(2)卷积神经网络:实例探究
    吴恩达《深度学习》第四门课(1)卷积神经网络
    解决Eclipse中springBoot中文乱码问题
    SpringBoot返回页面乱码解决
    【Maven】---Linux搭建Nexus3.X私服
    ASP.NET中TextBox控件设立ReadOnly="true"后台取不到值
    Winform打包工具SetupFactory 9 的使用
    PostgreSQL
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5418792.html
Copyright © 2011-2022 走看看