A12725 | Ropewalkers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Polycarp decided to relax on his weekend and visited to the performance of famous ropewalkers: Agafon, Boniface and Konrad.
The rope is straight and infinite in both directions. At the beginning of the performance, Agafon, Boniface and Konrad are located in positions $a$ , $b$ and $c$ respectively. At the end of the performance, the distance between each pair of ropewalkers was at least $d$ .
Ropewalkers can walk on the rope. In one second, only one ropewalker can change his position. Every ropewalker can change his position exactly by $1$ (i. e. shift by $1$ to the left or right direction on the rope). Agafon, Boniface and Konrad can not move at the same time (Only one of them can move at each moment). Ropewalkers can be at the same positions at the same time and can "walk past each other".
You should find the minimum duration (in seconds) of the performance. In other words, find the minimum number of seconds needed so that the distance between each pair of ropewalkers can be greater or equal to $d$ .
Ropewalkers can walk to negative coordinates, due to the rope is infinite to both sides.
The rope is straight and infinite in both directions. At the beginning of the performance, Agafon, Boniface and Konrad are located in positions $a$ , $b$ and $c$ respectively. At the end of the performance, the distance between each pair of ropewalkers was at least $d$ .
Ropewalkers can walk on the rope. In one second, only one ropewalker can change his position. Every ropewalker can change his position exactly by $1$ (i. e. shift by $1$ to the left or right direction on the rope). Agafon, Boniface and Konrad can not move at the same time (Only one of them can move at each moment). Ropewalkers can be at the same positions at the same time and can "walk past each other".
You should find the minimum duration (in seconds) of the performance. In other words, find the minimum number of seconds needed so that the distance between each pair of ropewalkers can be greater or equal to $d$ .
Ropewalkers can walk to negative coordinates, due to the rope is infinite to both sides.
输入格式
The only line of the input contains four integers $a$ , $b$ , $c$ , $d$ ( $1 \le a, b, c, d \le 10^9$ ). It is possible that any two (or all three) ropewalkers are in the same position at the beginning of the performance.
输出格式
Output one integer — the minimum duration (in seconds) of the performance.
输入输出样例
输入 #1
5 2 6 3
输出 #1
2
输入 #2
3 1 5 6
输出 #2
8
输入 #3
8 3 3 2
输出 #3
2
输入 #4
2 3 10 4
输出 #4
3
In the first example: in the first two seconds Konrad moves for 2 positions to the right (to the position $8$ ), while Agafon and Boniface stay at their positions. Thus, the distance between Agafon and Boniface will be $|5 - 2| = 3$ , the distance between Boniface and Konrad will be $|2 - 8| = 6$ and the distance between Agafon and Konrad will be $|5 - 8| = 3$ . Therefore, all three pairwise distances will be at least $d=3$ , so the performance could be finished within 2 seconds.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted