HDU 1046 Gridland

Gridland

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 5624    Accepted Submission(s): 2563


Problem Description

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 North–South or East–West 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. 



 

Input

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.

 

Output

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.

 

Sample Input

2
2 2
2 3

 

Sample Output

Scenario #1:
4.00

Scenario #2:
6.00

 

Source

Northwestern Europe 2001

 

Recommend

We have carefully selected several similar problems for you:  1038 1037 1033 1012 1036 

题意：一个矩形的地图，两个相邻的点距离为1，每个点的八个方向都可以走，把上面的点都走一遍，并且只能走一遍，问最短距离是多少，

思路：见代码。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int t;
int  n,m;
double sum;
scanf("%d",&t);
int k=1;
while(t--)
{
scanf("%d%d",&n,&m);
printf("Scenario #%d:\n",k++);
if(n%2&&m%2)
{
sum=(n*1.0)*(m*1.0)+1.414-1;
}
else
{
sum=(n*1.0)*(m*1.0);
}
printf("%.2lf\n",sum);
printf("\n");
}
return 0;
}