【18.69%】【codeforces 672C】Recycling Bottles
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的更多相关文章
- codeforces 672C C. Recycling Bottles(计算几何)
题目链接: C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input s ...
- Codeforces 671 A——Recycling Bottles——————【思维题】
Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
- 【 BowWow and the Timetable CodeForces - 1204A 】【思维】
题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...
- 【codeforces 761E】Dasha and Puzzle
[题目链接]:http://codeforces.com/contest/761/problem/E [题意] 给你一棵树,让你在平面上选定n个坐标; 使得这棵树的连接关系以二维坐标的形式展现出来; ...
- 【26.83%】【Codeforces Round #380C】Road to Cinema
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【23.33%】【codeforces 557B】Pasha and Tea
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【32.22%】【codeforces 602B】Approximating a Constant Range
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【77.78%】【codeforces 625C】K-special Tables
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
- 【84.62%】【codeforces 552A】Vanya and Table
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
随机推荐
- Python 局部变量转为全局变量
- day19 django继续
上节回顾 django - 路由系统:url.py - 视图函数:views.py - 模板引擎渲染 - HttpResonse(字符串) - render(request,'index.html') ...
- map的三种遍历方法!
map的三种遍历方法! 集合的一个很重要的操作---遍历,学习了三种遍历方法,三种方法各有优缺点~~ /* * To change this template, choose Tools | Te ...
- FastAdmin CMS 内容管理插件标签文档
FastAdmin CMS 内容管理插件标签文档 在CMS插件中的前端视图模板中有大量使用了自定义标签,我们在修改或制作模板的时候可以方便快捷的使用自定义标签来调用我们相关的数据. 标签库位于/add ...
- 从零学React Native之07View
View 组件是React Native最基本的组件.绝大部分其他React Native 组件. View组件的颜色和边框 backgroundColor 键用来指定颜色. RN 0.19版本开始, ...
- 查看JAVA占用CPU高的线程日志
# . 查看主进程占用cpu高 top # java # . 按照线程占用cpu由高到低进行排查: -o THREAD,tid, # USER %CPU PRI SCNT WCHAN USER SYS ...
- 1月北上广P2P平台之最 平台数成交量现双降
1月北上广P2P平台之最 平台数成交量现双降 今日(2月9日),网贷之家联合盈灿咨询发布了<北上广地区P2P网贷行业2017年1月月报>.月报数据显示,截至2017年1月底,北京.上海 ...
- Android 监听软键盘搜索键
现在很多的Android应用都有了数据搜索功能,在以往的设计上,会使用搜索框+搜索按钮来实现搜索功能: 现在呢,越来越流行的是,去除搜索按钮,直接监听软键盘搜索键,当用户输入完搜索关键字后,直接点击软 ...
- python元组和range
1.元组 1)元组介绍 元组: 俗称不可变的列表.⼜被成为只读列表, 元组也是python的基本数据类型之⼀, ⽤⼩括号括起来, ⾥⾯可以放任何数据类型的数据, 查询可以. 循环也可以. 切片也可以. ...
- @bzoj - 4922@ [Lydsy1706月赛]Karp-de-Chant Number
目录 @description@ @solution@ @accepted code@ @details@ @description@ 卡常数被称为计算机算法竞赛之中最神奇的一类数字,主要特点集中于令 ...