杭电1046
来源:互联网 发布:骑士引流软件 编辑:程序博客网 时间:2024/06/02 06:24
Gridland
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5246 Accepted Submission(s): 2390
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.
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.
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
如果m和n都是奇数的话,最后拐了一个弯,否则就直接绕一圈。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int flag=1,k;int m,n; int main(){scanf("%d",&k);while(k--){scanf("%d%d",&m,&n);if(m%2&&n%2){double ans=m*1.0*n*1.0+1.41-1;printf("Scenario #%d:\n",flag++);printf("%.2lf\n",ans);}else{double ans=m*1.0*n*1.00;printf("Scenario #%d:\n",flag++);printf("%.2lf\n",ans);}printf("\n");}}
0 0
- 杭电1046
- 杭电acm--1046
- 杭电1046
- 杭电
- 杭电
- 杭电
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- 杭电ACM1225
- 杭电ACM2023
- 杭电ACM2602
- 杭电ACM2955
- WinPcap笔记(2):获取设备列表
- 可加载异步图片的圆形imageView结合imageLoader
- proguard-project.txt文件,减少谷歌播放业务“的APK大小的影响
- 平铺图片、纹理
- Swift
- 杭电1046
- 对view事件分发的理解
- ACM JAVA+C常用方法模板
- 类的成员变量和 属性
- Linux虚拟机J2EE环境搭建 2、基础知识 解压/安装软件/root密码
- 用WMI获取磁盘硬件信息
- 例说android静态JNI调用C/C++代码——HelloWorld
- Android 编程下字库的使用
- 关于RTMP,RTMPT,RTMPS,RTMPE,RTMPTE协议的介绍