1.21 英语翻译打卡

链接：Gridland | JXNUOJ

描述：

For years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are the “easy” problems like sorting, evaluating a polynomial or finding the shortest path in a graph. For the “hard” ones only exponential-time algorithms are known. The traveling-salesman problem belongs to this latter group. Given a set of N towns and roads between these towns, the problem is to compute the shortest path allowing a salesman to visit each of the towns once and only once and return to the starting point.

The president of Gridland has hired you to design a program that calculates the length of the shortest traveling-salesman tour for the towns in the country. In Gridland, there is one town at each of the points of a rectangular grid. Roads run from every town in the directions North, Northwest, West, Southwest, South, Southeast, East, and Northeast, provided that there is a neighbouring town in that direction. The distance between neighbouring towns in directions NorthCSouth or EastCWest is 1 unit. The length of the roads is measured by the Euclidean distance. For example, Figure 7 shows 2 × 3-Gridland, i.e., a rectangular grid of dimensions 2 by 3. In 2 × 3-Gridland, the shortest tour has length 6.

多年以来，计算机科学家尝试着找到效率高的方法来计算不同的问题。有效率的方法已经可以掌握，比如简单的问题--分类整理，计算，以及在地图上找到最短的路径。旅商的问题属于后者难的问题。在N个小镇之间有多条路。问题是算出旅商在访问每个小镇各一次的情况下最终回到出发地点的最短路径。

在矩形的每个顶点各有一个小镇，道路四通八达，共八个走向。相邻小镇如南北之间，东西之间的距离是1欧式距离。单位是1欧式距离。例如，数字7表示Griland的面积为2*3，二维的矩形方格有三个。在2*3的Gridland,最短路径为6.

 

输入：

The first line contains the number of scenarios.

For each scenario, the grid dimensions m and n will be given as two integer numbers in a single line, separated by a single blank, satisfying 1 < m < 50 and 1 < n < 50.

第一行包括测试数据的个数

每组测试数据，每个方格是m个维度，n表示m维的方格有n个。m n以空格分隔。范围均是大于一并且小于五十。

输出：

The output for each scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. In the next line, print the length of the shortest traveling-salesman tour rounded to two decimal digits. The output for every scenario ends with a blank line.

每行各输出最短距离，保留两位小数，以Scenario #i: 打头，输出每个结果后空一行。