time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard 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:

Choose to stop or to continue to collect bottles.

If the choice was to continue then choose some bottle and walk towards it.

Pick this bottle and walk to the recycling bin.

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

【题解】



这道题求的是两个人总的最短的路程。

而且每次只能拿一个瓶子;

那么。如果两个人都到了垃圾桶的位置;

接下来谁去拿都一样了->完全可以一个人就站在垃圾桶的位置不动。->因为并不是求最短时间!

这样就转换成一个人的问题了;

同时每个垃圾到垃圾桶的距离也是固定的。

预处理一下即可;



dis[0][i]表示垃圾桶到第i个垃圾的距离;

dis[1][i]表示第一个人到第i个垃圾的距离;

dis[2][i]表示第二个人到第i个垃圾的距离;

则一开始预处理出sum=∑2*dis[0][i]

然后分类讨论;

1.第一个人捡起某个垃圾扔到垃圾桶,此后都由他捡。另外一个人至始至终都不动;

2.第二个人捡起某个垃圾扔到垃圾桶,此后都由他捡。另外一个人至始至终都不动;

3.两个人人都捡起一个垃圾(都选离自己最近的),扔到垃圾桶的位置。然后都由一个人捡。另外一个人站在垃圾桶的位置不动;

这里一个人的情况不会出现什么特殊的。

两个人的话,可能选择的是同一个垃圾X;

则处理出离两个人第二远的垃圾;

分别试试让第一个人捡这个X,第二个人捡离自己第二远的垃圾

或者是第一个人捡离自己第二远的垃圾,第二个人捡这个X;

捡垃圾Y的过程

可以表述为

sum-=dis[0][Y];

sum+=dis[t][Y];

t表示的是第几个人;

第一个人捡则加上dis[1][Y];

第二个人捡则加上dis[2][Y]

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#define LL long long using namespace std; const int MAXN = 1e5 + 100;
const double INF = 1e18; int ax, ay, bx, by, tx, ty, n;
int x[MAXN], y[MAXN];
double dis[3][MAXN]; void input(int &r)
{
r = 0;
char t = getchar();
while (!isdigit(t)) t = getchar();
int sign = 1;
if (t == '-')sign = -1;
while (!isdigit(t)) t = getchar();
while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
r = r*sign;
} double sqr(double x)
{
return x*x;
} double get_dis(double a0, double b0, double a1, double b1)
{
return sqrt(sqr(a0 - a1) + sqr(b0 - b1));
} int main()
{
//freopen("F:\\rush.txt", "r", stdin);
input(ax); input(ay); input(bx); input(by); input(tx); input(ty);
input(n);
for (int i = 1; i <= n; i++)
input(x[i]), input(y[i]);
for (int i = 1; i <= n; i++)
{
dis[0][i] = get_dis(tx, ty, x[i], y[i]);
dis[1][i] = get_dis(ax, ay, x[i], y[i]);
dis[2][i] = get_dis(bx, by, x[i], y[i]);
}
double sum = 0, fans;
for (int i = 1; i <= n; i++)
sum += 2 * dis[0][i];
//第一个人捡(一定选) 第二个人不捡
double misum1 = INF;
for (int i = 1; i <= n; i++)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[1][i];
misum1 = min(misum1, tempsum);
}
fans = misum1; //第二个人捡(一定选) 第一个人不捡
misum1 = INF;
for (int i = 1; i <= n; i++)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[2][i];
misum1 = min(misum1, tempsum);
}
fans = min(fans, misum1); //第一个个人捡,第二个人也捡
if (n > 1)
{
int num1;
misum1 = INF;
for (int i = 1; i <= n; i++)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[1][i];
if (tempsum < misum1)
{
num1 = i;
misum1 = tempsum;
}
}
int num2;
double misum2 = INF;
for (int i = 1; i <= n; i++)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[2][i];
if (tempsum < misum2)
{
num2 = i;
misum2 = tempsum;
}
}
if (num1 != num2)//捡的是不同的垃圾则可直接求得答案
{
double tempsum = sum;
tempsum -= dis[0][num1];
tempsum -= dis[0][num2];
tempsum += dis[1][num1];
tempsum += dis[2][num2];
fans = min(fans, tempsum);
}
else
{
int tnum1;
misum1 = INF;
for (int i = 1; i <= n; i++)
if (i != num1)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[1][i];
if (tempsum < misum1)
{
tnum1 = i;
misum1 = tempsum;
}
}
int tnum2;
double misum2 = INF;
for (int i = 1; i <= n; i++)
if (i != num1)
{
double tempsum = sum;
tempsum -= dis[0][i];
tempsum += dis[2][i];
if (tempsum < misum2)
{
tnum2 = i;
misum2 = tempsum;
}
} double tempsum = sum;
tempsum -= dis[0][num1];
tempsum -= dis[0][tnum2];
tempsum += dis[1][num1];
tempsum += dis[2][tnum2];
fans = min(fans, tempsum);
tempsum = sum;
tempsum -= dis[0][num1];
tempsum -= dis[0][tnum1];
tempsum += dis[2][num1];
tempsum += dis[1][tnum1];
fans = min(fans, tempsum);
}
}
printf("%.12lf\n", fans);
return 0;
}

【18.69%】【codeforces 672C】Recycling Bottles的更多相关文章

  1. codeforces 672C C. Recycling Bottles(计算几何)

    题目链接: C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input s ...

  2. Codeforces 671 A——Recycling Bottles——————【思维题】

     Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standard ...

  3. 【 BowWow and the Timetable CodeForces - 1204A 】【思维】

    题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...

  4. 【codeforces 761E】Dasha and Puzzle

    [题目链接]:http://codeforces.com/contest/761/problem/E [题意] 给你一棵树,让你在平面上选定n个坐标; 使得这棵树的连接关系以二维坐标的形式展现出来; ...

  5. 【26.83%】【Codeforces Round #380C】Road to Cinema

    time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...

  6. 【23.33%】【codeforces 557B】Pasha and Tea

    time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...

  7. 【32.22%】【codeforces 602B】Approximating a Constant Range

    time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...

  8. 【77.78%】【codeforces 625C】K-special Tables

    time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...

  9. 【84.62%】【codeforces 552A】Vanya and Table

    time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...

随机推荐

  1. PHPCMS快速建站系列之在线留言

    有两种方法 第一种方法: 利用留言板插件,在后台模板中,安装留言板插件使用,这里先不展开. 第二种方法: 表单向导的适用场合: 如果一个前台页面只是为了提交表单数据,那么就非常适合适用表单向导的功能, ...

  2. Servlet接口

    ServletRequest接口 ServletRequest的对象用于向Servlet提供客户端请求信息,如内容类型,内容长度,参数名称和值,标题信息,属性等. RequestDispatcher接 ...

  3. iOS开发周报-- 第一期

    从Java转iOS第一个项目总结 http://www.cocoachina.com/ios/20150417/11595.html icon设计探讨:图标,文字,还是图标加文字? http://ww ...

  4. 利用IDEA构建springboot应用-Controller的使用

    Controller的使用 @Controller 处理http请求   @RestController  Spring4之后新加的注解,原来返回json需要@ResponseBody配合@Contr ...

  5. Docker镜像部分详解

    拉取镜像: docker pull [选项] [Docker Registry 地址[:端口号]/]仓库名[:标签] Docker 镜像仓库地址:地址的格式一般是 [:端口号].默认地址是 Docke ...

  6. AtCoder Beginner Contest 075 D - Axis-Parallel Rectangle【暴力】

    AtCoder Beginner Contest 075 D - Axis-Parallel Rectangle 我要崩溃,当时还以为是需要什么离散化的,原来是暴力,特么五层循环....我自己写怎么都 ...

  7. 2019-11-20-dotnet-Blazor-用-C#-控制界面行为

    title author date CreateTime categories dotnet Blazor 用 C# 控制界面行为 lindexi 2019-11-20 18:26:25 +0800 ...

  8. 自定义View系列教程07--详解ViewGroup分发Touch事件

    深入探讨Android异步精髓Handler 站在源码的肩膀上全解Scroller工作机制 Android多分辨率适配框架(1)- 核心基础 Android多分辨率适配框架(2)- 原理剖析 Andr ...

  9. 在springmvc中 @RequestMapping(value={"", "/"})是什么意思

    这个意思是说请求路径 可以为空或者/ 我给你举个例子:比如百度知道的个人中心 访问路径是 http://zhidao.baidu.com/ihome,当然你也可以通过 http://zhidao.ba ...

  10. props & children

    一. choosing the type at runtime import React from 'react'; import { PhotoStory, VideoStory } from '. ...