ZOJ 1037 Gridland
来源:互联网 发布:塔利班和中国关系 知乎 编辑:程序博客网 时间:2024/06/05 10:31
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.
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
找规律
#include <iostream>#include <cmath>#include <iomanip>using namespace std;int main(){int n = 0, dim[2] = {0};double res;cin>>n;for(int i = 1; i <= n; i++){cin>>dim[0]>>dim[1];if(dim[0] % 2 == 0 || dim[1] % 2 ==0) res = dim[0] * dim[1];else res = dim[0] * dim[1] - 1 + sqrt(2);cout<<setiosflags(ios::fixed)<<setprecision(2)<<"Scenario #"<<i<<":"<<endl<<res<<endl<<endl;}return 0;}
- ZOJ-1037-Gridland
- zoj 1037 Gridland
- zoj 1037 Gridland
- zoj 1037 gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- zoj 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ - 1037 Gridland
- zoj 1037 Gridland
- ZOJ 1037 Gridland
- zoj 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ 1037 A - Gridland
- zoj 1037 Gridland
- zoj 1037 Gridland
- Dubbo与Zookeeper、SpringMVC整合和使用(负载均衡、容错)
- 搭建Hadoop2.7.2开发环境1(编译Eclipse中hadoop插件hadoop2x-eclipse-plugin)
- Linux 下SVN 命令行的使用
- 陶陶的难题
- 开发中遇到的错误
- ZOJ 1037 Gridland
- markdown使用LaTex输入数学公式类
- DOM编程练习(一)
- jquery添加中append和after的区别
- 【Android 2d游戏开发(1)】——五子棋
- memcached的最佳实践方案
- 快速掌握Lua 5.3 —— 调试库 (2)
- 字符串匹配
- ECNU_OJ_1002