CodeForces 3A Shortest path of the king(水题)

最新推荐文章于 2020-12-22 21:27:48 发布

围巾的ACM

最新推荐文章于 2020-12-22 21:27:48 发布

阅读量561

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51001788

水题专栏收录该内容

159 篇文章

订阅专栏

本文探讨了如何帮助国王从当前位置s移动到目标位置t的最短路径问题，详细介绍了通过斜向和横向移动策略逐步逼近目标的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

思路：水题，问从棋盘某点到某点的最短路径，并且输出，不难发现，能斜走就斜走，然后不断逼近目标就好了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 2005
#define LL long long
int cas=1,T;
string s1,s2;
string s[maxn];
int main()
{
	while (cin >> s1)
	{
		int ans = 0;

		cin >> s2;
		while (s1[0]<s2[0] && s1[1]<s2[1])
			s1[0]++,s1[1]++,s[ans++]="RU";
        while (s1[0]<s2[0] && s1[1]>s2[1])
			s1[0]++,s1[1]--,s[ans++]="RD";
		while (s1[0]>s2[0]&&s1[1]<s2[1])
			s1[0]--,s1[1]++,s[ans++]="LU";
		while (s1[0]>s2[0] && s1[1]>s2[1])
			s1[0]--,s1[1]--,s[ans++]="LD";
		while (s1[0]<s2[0])
			s1[0]++,s[ans++]="R";
		while (s1[0]>s2[0])
			s1[0]--,s[ans++]="L";
		while (s1[1]<s2[1])
            s1[1]++,s[ans++]="U";
		while (s1[1]>s2[1])
			s1[1]--,s[ans++]="D";
        printf("%d\n",ans);
		for (int i = 0;i<ans;i++)
			cout << s[i] << endl;
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

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.

$\text{[math]}$

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 1 to8.

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.

Sample Input

Input

a8
h1

Output

7
RD
RD
RD
RD
RD
RD
RD