CF 672C Recycling Bottles[最优次优 贪心]

C. Recycling Bottles

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.

We can think Central Perk as coordinate plane. There are n bottles on the ground, the i-th bottle is located at position (xi, yi). Both Adil and Bera can carry only one bottle at once each.

For both Adil and Bera the process looks as follows:

1. Choose to stop or to continue to collect bottles.
2. If the choice was to continue then choose some bottle and walk towards it.
3. Pick this bottle and walk to the recycling bin.
4. Go to step 1.

Adil and Bera may move independently. They are allowed to pick bottles simultaneously, all bottles may be picked by any of the two, it's allowed that one of them stays still while the other one continues to pick bottles.

They want to organize the process such that the total distance they walk (the sum of distance walked by Adil and distance walked by Bera) is minimum possible. Of course, at the end all bottles should lie in the recycling bin.

Input

First line of the input contains six integers ax, ay, bx, by, tx and ty (0 ≤ ax, ay, bx, by, tx, ty ≤ 109) — initial positions of Adil, Bera and recycling bin respectively.

The second line contains a single integer n (1 ≤ n ≤ 100 000) — the number of bottles on the ground.

Then follow n lines, each of them contains two integers xi and yi (0 ≤ xi, yi ≤ 109) — position of the i-th bottle.

It's guaranteed that positions of Adil, Bera, recycling bin and all bottles are distinct.

Output

Print one real number — the minimum possible total distance Adil and Bera need to walk in order to put all bottles into recycling bin. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if .

Examples

input

3 1 1 2 0 0
3
1 1
2 1
2 3

output

11.084259940083

input

5 0 4 2 2 0
5
5 2
3 0
5 5
3 5
3 3

output

33.121375178000

Note

Consider the first sample.

Adil will use the following path: .

Bera will use the following path: .

Adil's path will be  units long, while Bera's path will be  units long.

---

稍微一想，除了开始后面都是从bin来回

只要找从a b到某个瓶子比从bin到节省最多就可以了

特殊情况太多：

有人是负值 不走他

最优瓶子一样 找次优

次优中还有负值

调了一个多小时，WA无数

//
//  main.cpp
//  cf672c
//
//  Created by Candy on 9/15/16.
//  Copyright © 2016 Candy. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const double INF=1e10;
inline int read(){
    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-;c=getchar();}
    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}
    return x;
}
int xa,ya,xb,yb,xt,yt,x,y;
int n,bot[];
double mx[],sum=;//1 2->a  3 4->b
double dist(ll a,ll b){
    return sqrt(a*a+b*b);
}
double getans(double a,double b){
    if(a<||b<){//printf("flag2\n");
        if(a<b) a=;
        else b=;
    }
return a+b;
}
int main(int argc, const char * argv[]) {
    mx[]=mx[]=mx[]=mx[]=-INF;
    scanf("%d%d%d%d%d%d%d",&xa,&ya,&xb,&yb,&xt,&yt,&n);//cout<<"\na"<<xa<<" "<<ya<<"\n";
    for(int i=;i<=n;i++){
        x=read();y=read();
        double to=dist(x-xt,y-yt); sum+=to*;//printf("to %d %d %lf\n",x-xt,y-yt,to);
        double t1=to-dist(x-xa,y-ya),t2=to-dist(x-xb,y-yb);
        if(t1>mx[]){
            mx[]=mx[]; bot[]=bot[];
            mx[]=t1; bot[]=i;
        }else if(t1>mx[]){
            mx[]=t1; bot[]=i;
        }
        if(t2>mx[]){
            mx[]=mx[]; bot[]=bot[];
            mx[]=t2; bot[]=i;
        }else if(t2>mx[]){
            mx[]=t2; bot[]=i;
        }
    }

    //if(n==1) {printf("%.12f",sum-max(mx[1],mx[3]));return 0;}
    //printf("%lf %d %lf %d\n",mx[1],bot[1],mx[3],bot[3]);
    if(mx[]<||mx[]<){//printf("flag2\n");
        if(mx[]<mx[]) mx[]=,bot[]=;
        else mx[]=,bot[]=;
    }
    if(bot[]==bot[]){//printf("flag1 %lf %lf\n",mx[2],mx[4]);
        if(getans(mx[],mx[])>getans(mx[],mx[])){
            mx[]=mx[];//cout<<mx[1]<<" mx1\n";
        }else{
            mx[]=mx[];//,cout<<mx[3]<<" mx3\n";
        }
        if(mx[]<||mx[]<){//printf("flag2\n");
            if(mx[]<mx[]) mx[]=,bot[]=;
            else mx[]=,bot[]=;
        }
    }
    printf("%.12f",sum-mx[]-mx[]);
    return ;
}