杭电ACM OJ 1030 Delta-wave 3维降2维坐标系法+图的搜索法

最新推荐文章于 2022-06-04 17:53:25 发布

徐乙

最新推荐文章于 2022-06-04 17:53:25 发布

阅读量473

点赞数

分类专栏：算法题文章标签：杭电ACM OJ 1030 Delta-wave 3维降2维坐标系法图的搜索法

本文链接：https://blog.csdn.net/qq_36523667/article/details/78703747

版权

博客详细介绍了杭电ACM在线判题（OJ）中1030题——Delta-wave的解决方案。通过3维坐标系降至2维坐标系的方法，结合图的搜索算法，阐述了如何有效地解决这一问题。

摘要由CSDN通过智能技术生成

Delta-wave

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

Problem Description

A triangle field is numbered with successive integers in the way shown on the picture below.

The traveller needs to go from the cell with number M to the cell with number N. The traveller is able to enter the cell through cell edges only, he can not travel from cell to cell through vertices. The number of edges the traveller passes makes the length of the traveller's route.

Write the program to determine the length of the shortest route connecting cells with numbers N and M.

Input

Input contains two integer numbers M and N in the range from 1 to 1000000000 separated with space(s).

Output

Output should contain the length of the shortest route.

Sample Input