Codeforces Recycling Bottles 模拟
2 seconds
256 megabytes
standard input
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:
- 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.
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.
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 .
3 1 1 2 0 0
3
1 1
2 1
2 3
11.084259940083
5 0 4 2 2 0
5
5 2
3 0
5 5
3 5
3 3
33.121375178000
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.
题目链接:http://codeforces.com/contest/672/problem/C
题意:一个广场有n个瓶子,有a,b两个人和一个垃圾桶。捡了瓶子后马上丢到垃圾桶,求两个人的最短路程。
思路:第一次捡瓶子要走的距离就是人到瓶子的距离+瓶子到垃圾桶的距离,第二次捡瓶子要走的距离就是另外一个人到瓶子的距离+瓶子到垃圾桶的距离(或者另外一个人不捡瓶子)。捡其他瓶子要走的距离是垃圾桶到瓶子的距离*2。做差值进行排序。sign1,sign2表示一个人差值最大的两个值。sign3,sign4表示另外一个人差值最大的两个值。总共有5种情况表示人到瓶子的距离+瓶子到垃圾桶的距离(1)sign1;(2)sign3;(3)sign1,sign3;(4)sign1,sign4;(5)sign2,sign3;其中第3种情况要两个瓶子不是同一个。
代码:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int MAXN = 1e5+, mod = 1e9 + , inf = 0x3f3f3f3f;
typedef long long ll;
const ll INF = (1ll<<);
struct gg
{
double d;
int i;
} sub1[],sub2[];
int cmp(gg a,gg b)
{
return a.d>b.d;
}
int main()
{
int i;
double ax,ay,bx,by,tx,ty;
int n;
double x,y;
double ans=;
scanf("%lf%lf%lf%lf%lf%lf",&ax,&ay,&bx,&by,&tx,&ty);
scanf("%d",&n);
for(i=; i<n; i++)
{
scanf("%lf%lf",&x,&y);
double sign1=sqrt((x-ax)*(x-ax)+(y-ay)*(y-ay))+sqrt((x-tx)*(x-tx)+(y-ty)*(y-ty));
double sign2=sqrt((x-bx)*(x-bx)+(y-by)*(y-by))+sqrt((x-tx)*(x-tx)+(y-ty)*(y-ty));
double d=2.0*sqrt((x-tx)*(x-tx)+(y-ty)*(y-ty));
sub1[i].d=d-sign1;
sub2[i].d=d-sign2;
sub1[i].i=sub2[i].i=i;
ans+=d;
}
sort(sub1,sub1+n,cmp);
sort(sub2,sub2+n,cmp);
double sign1=sub1[].d,sign2=sub1[].d,sign3=sub2[].d,sign4=sub2[].d;
int sign1_i=sub1[].i,sign2_i=sub1[].i,sign3_i=sub2[].i,sign4_i=sub2[].i;
double sign,Min=1e15;
sign=ans-sign1;
if(sign<Min) Min=sign;
sign=ans-sign3;
if(sign<Min) Min=sign;
if(sign1_i!=sign3_i)
{
sign=ans-sign1-sign3;
if(sign<Min) Min=sign;
}
sign=ans-sign1-sign4;
if(sign<Min) Min=sign;
sign=ans-sign2-sign3;
if(sign<Min) Min=sign;
printf("%.12f\n",Min);
return ;
}
Codeforces Recycling Bottles 模拟的更多相关文章
- Codeforces Round #352 (Div. 1) A. Recycling Bottles 暴力
A. Recycling Bottles 题目连接: http://www.codeforces.com/contest/671/problem/A Description It was recycl ...
- Codeforces Round #352 (Div. 2) C. Recycling Bottles 贪心
C. Recycling Bottles It was recycling day in Kekoland. To celebrate it Adil and Bera went to Centr ...
- codeforces 352 div 2 C.Recycling Bottles 贪心
C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standar ...
- Codeforces 671 A——Recycling Bottles——————【思维题】
Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
- Codeforces Round #352 (Div. 2) C. Recycling Bottles
C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input stand ...
- codeforces 672C C. Recycling Bottles(计算几何)
题目链接: C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input s ...
- CF 672C Recycling Bottles[最优次优 贪心]
C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standar ...
- 【模拟】Codeforces 671A Recycling Bottles
题目链接: http://codeforces.com/problemset/problem/671/A 题目大意: A和B在一张二维平面上,平面上有N个垃圾,垃圾桶只有一个在T,问把所有垃圾全扔进垃 ...
- 【18.69%】【codeforces 672C】Recycling Bottles
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
随机推荐
- php基础和数据库
服务器和客户端 客户端 程序: 通过浏览器直接运行 服务器 程序: 通过安装某种服务器软件 程序才可以运行 apache php文件 tom ...
- CSS 3 学习笔记
css 3 学习笔记 文本: word-wrap : normal | break-word取值:normal: 控制连续文本换行.break-word: 内容将在边界内换行.如果需要,词 ...
- HTML|CSS之布局相关总结
知识内容: 1.浮动相关 2.display属性 3.居中显示 4.盒模型和box-sizing 5.position属性 6.响应式设计 7.flex布局 8.其他 参考:http://zh.lea ...
- VC如何得到一个文件夹的路径
VC中没有现成的函数来选择一个文件夹,但这是经常会用到的,怎么办?自动动手,丰衣足食! 使用SHBrowseForFolder,代码如下: #include int SelFolder(HWND ...
- 详解Tomcat配置及使用
2018年06月27日 23:42:34 尘埃丶落定 阅读数:2351 版权声明:本文为博主原创文章,转载请附上作者与出处. https://blog.csdn.net/longyin0528/ ...
- 编码风格和PEP8规范
编码风格 错误认知 这很浪费时间 我是个艺术家 所有人都能穿的鞋不会合任何人的脚 我善长制定编码规范 正确认知 促进团队合作 减少bug处理 提高可读性,降低维护成本 有助于代码审查 养成习惯,有助于 ...
- Springboot spring data jpa 多数据源的配置01
Springboot spring data jpa 多数据源的配置 (说明:这只是引入了多个数据源,他们各自管理各自的事务,并没有实现统一的事务控制) 例: user数据库 global 数据库 ...
- 使用MATPLOTLIB 制图(散点图,热力图)
import numpy as np import pandas as pd import matplotlib.pyplot as plt data = pd.read_csv('D:\\myfil ...
- HTML 表格标签
<table border="1"> <tr> <td>row 1, cell 1</td> <td>row 1, ce ...
- IPMS 元件实作
一.改用zg框架的jsp 1.引入表头和表尾jsp <%@ include file="../../jsp/menuHeader.jsp"%> <%@ inclu ...