poj1450
来源:互联网 发布:关于人工智能的辩论赛 编辑:程序博客网 时间:2024/05/15 23:43
Gridland
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8321 Accepted: 4217
Description
Background
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.
Problem
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.
Figure 7: A traveling-salesman tour in 2 ? 3-Gridland.
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.
Problem
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.
Figure 7: A traveling-salesman tour in 2 ? 3-Gridland.
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.
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
22 22 3
Sample Output
Scenario #1:4.00Scenario #2:6.00
Source
Northwestern Europe 2001
0 0
- poj1450
- poj1450
- poj1450
- poj1450
- POJ1450
- poj1450
- poj1450 - Gridland
- POJ1450 Gridland [找规律]
- 北大ACM poj1450
- POJ1450解题报告
- HDU1046 POJ1450 UVALive2334 Gridland
- ZOJ1073 POJ1450 Gridland 投机取巧版。。。
- 06-2. 字符串字母大小写转换(10)
- [LeetCode]Populating Next Right Pointers in Each Node II
- 三维重建论文整理2
- "error while loading shared libraries: xxx.so.x"错误的原因和解决办法
- jquery之动态绑定事件
- poj1450
- report need backup备份冗余度
- CC2530 的IO口中断
- 06-3. 单词长度(15)
- 从storyboard加载视图控制器
- Android图表引擎AChartEngine简单demo详细注释
- bzoj1037: [ZJOI2008]生日聚会Party DP
- STM32 DMA 串口透传
- 工厂模式