zoukankan      html  css  js  c++  java
  • hdu 1046

    Gridland

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 2455    Accepted Submission(s): 1168


    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
     1 #include <iostream>
     2 #include <cstdlib>
     3 #include <cstdio>
     4 #include <cmath>
     5 
     6 using namespace std;
     7 
     8 int main(void)
     9 {
    10     int n;
    11 #ifndef ONLINE_JUDGE
    12     freopen("1046.in", "r", stdin);
    13 #endif
    14     scanf("%d", &n);
    15     for (int i = 1; i < n + 1; ++i)
    16     {
    17         printf("Scenario #%d:\n", i);
    18         int s, t;
    19         scanf("%d%d",&s,&t);
    20         double sum;
    21         sum = s*t;
    22         if ((s*t)%2)
    23             printf("%.2f\n", sum+sqrt(2)-1);
    24         else printf("%.2f\n", (double)sum);
    25         printf("\n");
    26         /*if (i != n)
    27             printf("\n");*/
    28     }
    29 
    30     return 0;
    31 }

    这题POJ做过的,不要怕,找规律就好

  • 相关阅读:
    CSS箭头
    rails 路由正则表达式
    centos6.7 配置MongoDB日志
    centos6.7 配置Elasticsearch
    拼音纠错
    Pandas学习笔记
    WebService using Spring throwed org.xml.sax.SAXException: Bad envelope tag: htm
    怎样让Windows任务管理器CPU占用率呈现正玄曲线(解释+C#实现)
    Deepin Linux获得关注,国产GUI值得提倡
    Swing组件的另类嵌套
  • 原文地址:https://www.cnblogs.com/liuxueyang/p/2870786.html
Copyright © 2011-2022 走看看