zoukankan      html  css  js  c++  java
  • POJ2420——三分——A Star not a Tree?

    Luke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to connect any number of computers together in a linear arrangement. Luke is particulary proud that he solved a nasty NP-complete problem in order to minimize the total cable length. 
    Unfortunately, Luke cannot use his existing cabling. The 100mbs system uses 100baseT (twisted pair) cables. Each 100baseT cable connects only two devices: either two network cards or a network card and a hub. (A hub is an electronic device that interconnects several cables.) Luke has a choice: He can buy 2N-2 network cards and connect his N computers together by inserting one or more cards into each computer and connecting them all together. Or he can buy N network cards and a hub and connect each of his N computers to the hub. The first approach would require that Luke configure his operating system to forward network traffic. However, with the installation of Winux 2007.2, Luke discovered that network forwarding no longer worked. He couldn't figure out how to re-enable forwarding, and he had never heard of Prim or Kruskal, so he settled on the second approach: N network cards and a hub. 

    Luke lives in a loft and so is prepared to run the cables and place the hub anywhere. But he won't move his computers. He wants to minimize the total length of cable he must buy.

    Input

    The first line of input contains a positive integer N <= 100, the number of computers. N lines follow; each gives the (x,y) coordinates (in mm.) of a computer within the room. All coordinates are integers between 0 and 10,000.

    Output

    Output consists of one number, the total length of the cable segments, rounded to the nearest mm.

    Sample Input

    4
    0 0
    0 10000
    10000 10000
    10000 0
    

    Sample Output

    28284
    /*
    三分里面的三分
    
    */
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    using namespace std;
    
    struct edge{
        double x, y;
    }a[110];
    const double inf = 1e9 + 100;
    double dis, diss;
    int n;
    
    double checky(double x, double y)
    {
        double dis = 0;
         for(int i = 1; i <= n; i++){
         dis += sqrt((x - a[i].x)*(x - a[i].x) + (y - a[i].y)*(y - a[i].y));
         } 
         return dis;
    }
    
    double checkx(double x)
    {
        double ly = -inf, ry = inf;
        for(int i = 1; i <= 100; i++){
            double midy = (ly + ry)/2;
            double midmidy = (ry + midy)/2;
            if(checky(x, midy) > checky(x, midmidy))
                ly = midy;
            else ry = midmidy;
            diss = min(checky(x, midy), checky(x , midmidy));
        }
        return diss;
    }
    
    
    
    
    int main()
    {
        while(~scanf("%d", &n)){
            diss = inf;
            for(int i = 1; i <= n ; i++)
                scanf("%lf%lf", &a[i].x, &a[i].y);
            double lx = -inf, rx = inf;
            for(int i = 1; i <= 100; i++){
                double midx = (lx + rx)/2;
                double midmidx = (rx + midx)/2;
                if(checkx(midx) > checkx(midmidx))
                    lx = midx;
                else rx = midmidx;
                }
            //printf("%f %f
    ", lx, rx);
            printf("%.0f
    ", diss);
        }
        return 0;
    }
    

      

  • 相关阅读:
    OCM_Session1_2_Server-side Network Configuration
    sql union代替or
    创建组合索引SQL从1个多小时到1S的案例
    OCM_session0手动建库实验
    慎用位图索引
    Java之List排序
    Java之List排序出错
    dojo、iframe和FusionCharts兼容性
    Java之indexOf()方法
    Java之split()方法
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4694178.html
Copyright © 2011-2022 走看看