试试

dsa

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cassert>
using namespace std;
#define maxn 100005
#define ll long long
#define inf 2147483647
#define INF 9223372036854775807
#define db double
int i,m,n;

struct pos {

    int x,y;

}a,b,t,c[maxn];

double dis(pos xx,pos yy)
{
    double dist = 0;
    dist = (db(xx.x-yy.x)*(xx.x-yy.x)+(db)(xx.y-yy.y)*(xx.y-yy.y));
    dist = sqrt(dist);
    return dist;
}
int main()
{
    while(cin >>a.x >> a.y >> b.x >> b.y >>t.x >>t.y)
    {
        cin >> n;
        db sum=0;
        for(i=1;i<=n;i++)
        {
            cin >> c[i].x >> c[i].y;
            sum +=2* dis(c[i],t);
        }
        db maa=0;
        db mab=0;
        double daa,dbb;
        double ma=1e20;
        db mb=1e20 ;
        int flaga=0;
        int flagb=0;
        for(i=1;i<=n;i++)
        {
            daa = dis(a,c[i])-dis(c[i],t);
            dbb = dis(b,c[i])-dis(c[i],t);
            if(daa<maa)
            {
                ma = maa;
                maa = daa;
                flaga = i;
            }
            else if(daa < ma)
            {
                ma = daa;
            }
            if(dbb < mab)
            {
                mb = mab;
                mab = dbb;
                flagb = i;
            }
            else if(dbb < mb)
            {
                mb = dbb;
            }
        }
        double temp = 0;
        if(flaga&&flagb)
        {

            if(flaga==flagb)
            {
                temp+=min(maa+mb,mab+ma);
            }
            else
            {
                temp+=maa;
                temp+=mab;
            }
        }
        else if(flaga>0||flagb>0)
        {
            if(flaga>0)
            {
                temp+=maa;
            }
            if(flagb>0)
            {
                temp+=mab;
            }
        }
        else
        {
            temp+=min(ma,mb);
        }

        printf("%.12lf\n",sum+temp);

    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值