Gridland
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5457 Accepted Submission(s): 2483
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.
首先,说下本题的题意,本题的题意为从第一个点出发,走完所有的点再回到第一个点,所走过的距离是多少。
本题最大的问题是在精度问题上。
卡了好几发。
下面跟大家一起推下规律
假如是3x3的矩形
1 1 1
1 1 1
1 1 1
所走过的距离为8加根下2。
假如是2x2的矩形
1 1
1 1
此时走过的距离为4。
假如3x2的矩形
1 1
1 1
1 1
走过的距离为6
所以得出一个规律,只有当n和m全为奇数的时候所走过的距离为n*m+0.41,否则走过的距离为n*m.
解释到这里吧,
下面附上AC代码。
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int t,iCase=0;
scanf("%d",&t);
while(t--)
{
iCase++;
double n,m;
scanf("%lf%lf",&m,&n);
double sum=0;
if((int)n%2==1&&(int)m%2==1)
{
sum=m*n+0.41;
}
else
{
sum=m*n;
}
printf("Scenario #%d:\n",iCase);
printf("%.2lf\n",sum);
printf("\n");
}
return 0;
}