【模拟】Codeforces 671A Recycling Bottles

  1 //
  2 //by coolxxx
  3 //#include<bits/stdc++.h>
  4 #include<iostream>
  5 #include<algorithm>
  6 #include<string>
  7 #include<iomanip>
  8 #include<map>
  9 #include<memory.h>
 10 #include<time.h>
 11 #include<stdio.h>
 12 #include<stdlib.h>
 13 #include<string.h>
 14 //#include<stdbool.h>
 15 #include<math.h>
 16 #define min(a,b) ((a)<(b)?(a):(b))
 17 #define max(a,b) ((a)>(b)?(a):(b))
 18 #define abs(a) ((a)>0?(a):(-(a)))
 19 #define lowbit(a) (a&(-a))
 20 #define sqr(a) ((a)*(a))
 21 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
 22 #define mem(a,b) memset(a,b,sizeof(a))
 23 #define eps (1e-8)
 24 #define J 10
 25 #define mod 1000000007
 26 #define MAX 0x7f7f7f7f
 27 #define PI 3.14159265358979323
 28 #define N 100004
 29 using namespace std;
 30 typedef long long LL;
 31 int cas,cass;
 32 int n,m,lll,ans;
 33 double anss;
 34 struct xxx
 35 {
 36     LL x,y;
 37     double disa,disb,dist;
 38 }q[N],a,b,t;
 39 double dis(xxx aa,xxx bb)
 40 {
 41     return sqrt(sqr(aa.x-bb.x)+sqr(aa.y-bb.y));
 42 }
 43 bool cmp(xxx aa,xxx bb)
 44 {
 45     return aa.dist<bb.dist;
 46 }
 47 int main()
 48 {
 49     #ifndef ONLINE_JUDGE
 50     freopen("1.txt","r",stdin);
 51 //    freopen("2.txt","w",stdout);
 52     #endif
 53     int i,j,ma,mb;
 54     double ax,ay,bx,by,z;
 55 //    for(scanf("%d",&cas);cas;cas--)
 56 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
 57     while(~scanf("%I64d",&a.x))
 58 //    while(~scanf("%d",&n))
 59     {
 60         anss=0;ay=by=0;
 61         scanf("%I64d%I64d%I64d%I64d%I64d",&a.y,&b.x,&b.y,&t.x,&t.y);
 62         scanf("%d",&n);
 63         for(i=1;i<=n;i++)
 64         {
 65             scanf("%I64d%I64d",&q[i].x,&q[i].y);
 66             q[i].disa=dis(a,q[i]);
 67             q[i].disb=dis(b,q[i]);
 68             q[i].dist=dis(t,q[i]);
 69         }
 70         sort(q+1,q+1+n,cmp);
 71         anss=q[1].dist+q[1].dist;
 72         ax=q[1].dist-q[1].disa;
 73         bx=q[1].dist-q[1].disb;
 74         ma=mb=1;
 75         for(i=2;i<=n;i++)
 76         {
 77             anss+=q[i].dist+q[i].dist;
 78             z=q[i].dist-q[i].disa;
 79             if(ax<z)
 80             {
 81                 ay=max(ax,ay);
 82                 ax=z;
 83                 ma=i;
 84             }
 85             else ay=max(ay,z);
 86             z=q[i].dist-q[i].disb;
 87             if(bx<z)
 88             {
 89                 by=max(bx,by);
 90                 bx=z;
 91                 mb=i;
 92             }
 93             else by=max(by,z);
 94         }
 95         if(ma!=mb)z=ax+bx;
 96         else z=max(ax+by,bx+ay);
 97         z=max(z,ax);
 98         z=max(z,bx);
 99         printf("%.12lf\n",anss-z);
100     }
101     return 0;
102 }
103 /*
104 //
105 
106 //
107 */