2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem B. Travelling Camera Problem set贪心
Problem B. Travelling Camera Problem
题目连接:
http://www.codeforces.com/gym/100253
Description
Programming competitions become very popular in Berland. Now Berland Broadcasting Corporation
(BBC) plans to organize a TV broadcast of the All-Berland Regional Contest. The contest will be in a
narrow hall stretched from the left to the right. BBC puts a long straight rail with a camera on it along
the hall. The rail starts from the left wall and goes along the hall to the right wall.
Not every position of the camera on the rail is suitable for shooting. The cameraman has chosen m
shooting positions on the rail: c1, c2, . . . , cm, where ci
is the distance (in meters) from the i-th position to
the left wall. Initially the camera will be at the position c1.
The reporter has prepared the plan showing how she will move tomorrow. She will move only along a
line parallel to the rail on the distance 1 meter from the rail. So each her position is dened by a single
number x the distance (in meters) from the left wall.
The coverage will consist of n scenes. The rst scene will be at the position x1, so the reporter will start
the live coverage there. The second scene will be at the position x2, so she will move from x1 to x2 between
the scenes. The third scene will be at the position x3 and so on. In total the reporter will successively
visit n positions x1, x2, . . . , xn, the j-th scene will be at xj .
For sure it is a bad idea to shoot the reporter if she is too far from the camera. It should be at most r
meters to the reporter at the moments of scenes.
Write a program to nd the minimum total distance the camera will move tomorrow. You may assume
that both the camera and the reporter move only along their lines, the maximum speed of the camera is
enough to keep up with the reporter.
Input
The rst line of the input contains three integer numbers m (2 ≤ m ≤ 3 · 105
), n (2 ≤ n ≤ 3 · 105
), r
(1 ≤ r ≤ 1000), where m is the number of positions where the camera can shoot, n is the number of
scenes and r is the maximum distance between the camera and the reporter in the moments of scenes.
The second line contains valid camera positions: m real numbers c1, c2, . . . , cm (0 ≤ ci ≤ 106
). The
numbers are given with exactly one digit after the decimal point. They are given in the strictly increasing
order (ci < ci+1 for each 1 ≤ i < m).
The third line contains positions of scenes in the chronological order: n real numbers x1, x2, . . . , xn
(0 ≤ xj ≤ 106
). The numbers are given with exactly one digit after the decimal point. These numbers are
not necessarily distinct.
It is guaranteed that it is possible to nd at least one valid camera position for each scene
Output
Print a single real number with at least one digit after the decimal point the minimum total distance
the camera needs to move to shoot all the scenes.
Sample Input
4 3 4
10.0 20.0 30.0 40.0
31.0 41.0 20.0
Sample Output
50.0
Hint
题意
给你摄像头的坐标,给你人依次所在的位置,你摄像头能够照到这个人的条件是,你们俩的坐标距离相差小于等于k
问你摄像头最少走多少米
题解:
对于每个人,可以划分出一个区间来,然后贪心的走最少的路程到达这个区间就好了。
代码
#include<bits/stdc++.h>
using namespace std;
int n,m;
double k;
set<double>S;
int main()
{
scanf("%d%d%lf",&n,&m,&k);
double now;
for(int i=1;i<=n;i++)
{
double x;
cin>>x;
if(i==1)now=x;
S.insert(x);
}
double ans = 0;
double len = sqrt(k*k-1);
for(int i=1;i<=m;i++)
{
double x;
cin>>x;
if(x+len>=now&&x-len<=now)continue;
double L = *S.lower_bound(x-len);
double R = *--S.upper_bound(x+len);
if(abs(L-now)<abs(R-now))
{
ans+=abs(L-now);
now=L;
}
else
{
ans+=abs(R-now);
now=R;
}
}
printf("%.12f\n",ans);
}
2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem B. Travelling Camera Problem set贪心的更多相关文章
- 2018-2019 ICPC, NEERC, Southern Subregional Contest
目录 2018-2019 ICPC, NEERC, Southern Subregional Contest (Codeforces 1070) A.Find a Number(BFS) C.Clou ...
- Codeforces 2018-2019 ICPC, NEERC, Southern Subregional Contest
2018-2019 ICPC, NEERC, Southern Subregional Contest 闲谈: 被操哥和男神带飞的一场ACM,第一把做了这么多题,荣幸成为7题队,虽然比赛的时候频频出锅 ...
- 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror) Solution
从这里开始 题目列表 瞎扯 Problem A Find a Number Problem B Berkomnadzor Problem C Cloud Computing Problem D Gar ...
- Codeforces1070 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)总结
第一次打ACM比赛,和yyf两个人一起搞事情 感觉被两个学长队暴打的好惨啊 然后我一直做傻子题,yyf一直在切神仙题 然后放一波题解(部分) A. Find a Number LINK 题目大意 给你 ...
- codeforce1070 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) 题解
秉承ACM团队合作的思想懒,这篇blog只有部分题解,剩余的请前往星感大神Star_Feel的blog食用(表示男神汉克斯更懒不屑于写我们分别代写了下...) C. Cloud Computing 扫 ...
- 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)
A. Find a Number 找到一个树,可以被d整除,且数字和为s 记忆化搜索 static class S{ int mod,s; String str; public S(int mod, ...
- 2018.10.20 2018-2019 ICPC,NEERC,Southern Subregional Contest(Online Mirror, ACM-ICPC Rules)
i207M的“怕不是一个小时就要弃疗的flag”并没有生效,这次居然写到了最后,好评=.= 然而可能是退役前和i207M的最后一场比赛了TAT 不过打得真的好爽啊QAQ 最终结果: 看见那几个罚时没, ...
- 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) Solution
A. Find a Number Solved By 2017212212083 题意:$找一个最小的n使得n % d == 0 并且 n 的每一位数字加起来之和为s$ 思路: 定义一个二元组$< ...
- 【*2000】【2018-2019 ICPC, NEERC, Southern Subregional Contest C 】Cloud Computing
[链接] 我是链接,点我呀:) [题意] [题解] 我们可以很容易知道区间的每个位置有哪些安排可以用. 显然 我们优先用那些花费的钱比较少的租用cpu方案. 但一个方案可供租用的cpu有限. 我们可以 ...
- 2018-2019 ICPC, NEERC, Southern Subregional Contest (codeforces 1070)
A. 直接从状态(0,0)bfs, 这样一定是最小的 #include <iostream> #include <sstream> #include <algorithm ...
随机推荐
- Codeforces 662 C. Binary Table
http://codeforces.com/contest/662/problem/C 题意:n行m列01矩阵,每次可以反转一行或一列,问最后最少可以剩下多少个1 n只有20,把行状态压缩 操作奇数次 ...
- Git 操作指南
http://blog.csdn.net/troy__/article/details/40082657
- 20155303 2016-2017-2 《Java程序设计》第六周学习总结
20155303 2016-2017-2 <Java程序设计>第六周学习总结 课堂笔记 高效学习法推荐 看视频学习(2h)→ 以代码为中心看课本,思考运行结果并验证(3h)→ 课后作业验证 ...
- java学习第04天(语句、函数、数组)
(3)循环结构 格式: for(初始化表达式,循环条件表达式,循环后的操作变大时){ 执行语句,循环体: } 注: a. for循环里面的连个表达式运行的顺序,初始化表达式只读一次,判断循环条件,为真 ...
- grep 正则表达
常见的 grep 正则表达参数 -c # 显示匹配到得行的数目,不显示内容 -h # 不显示文件名 -i # 忽略大小写 -l # 只列出匹配行所在文件的文件名 -n # 在每一行中加上相对行号 -s ...
- 2016最新的中国省市区三级数据库表.sql mssql
/****** Object: Table [dbo].[t_Area] Script Date: 09/10/2016 09:35:46 ******/ SET ANSI_NULLS ON GO S ...
- TCP/UDP区别&&心跳包机制【转】
转自:https://www.jianshu.com/p/6d93a3c21c34 UDP:用户数据报协议:主要用在实时性要求比较高的以及对质量相对较弱的地方.但是面对现在高质量的线路不会容易丢包,除 ...
- ispoweroftwo 判断2的次幂【转】
转自:https://www.cnblogs.com/troublelost/p/5236391.html 首先结果是: public bool IsPowerOfTwo(int n) { if(n& ...
- Kali Linux没有声音的解决方法
Kali Linux系统默认状态下,root用户是无法使用声卡的,也就没有声音.启用的方法如下: (1)在终端执行命令:systemctl --user enable pulseaud ...
- 09 Go 1.9 Release Notes
Go 1.9 Release Notes Introduction to Go 1.9 Changes to the language Ports ppc64x requires POWER8 Fre ...