USACO 2018年2月赛铜级题1
Teleportation
One of the farming chores Farmer John dislikes the most is hauling around lots of cow manure.
In order to streamline this process, he comes up with a brilliant invention: the manure teleporter! Instead of hauling manure between two points in a cart behind his tractor, he can use the manure teleporter to instantly transport manure from one location to another.
Farmer John's farm is built along a single long straight road, so any location on his farm can be described simply using its position along this road (effectively a point on the number line).
A teleporter is described by two numbers xx and yy, where manure brought to location xx can be instantly transported to location yy, or vice versa.
Farmer John wants to transport manure from location aa to location bb, and he has built a teleporter that might be helpful during this process (of course, he doesn't need to use the teleporter if it doesn't help).
Please help him determine the minimum amount of total distance he needs to haul the manure using his tractor.
INPUT FORMAT (file teleport.in):
The first and only line of input contains four space-separated integers: aa and bb, describing the start and end locations, followed by xx and yy, describing the teleporter.
All positions are integers in the range 0…1000…100, and they are not necessarily distinct from each-other.
OUTPUT FORMAT (file teleport.out):
Print a single integer giving the minimum distance Farmer John needs to haul manure in his tractor.
SAMPLE INPUT:
3 10 8 2
SAMPLE OUTPUT:
3
In this example, the best strategy is to haul the manure from position 3 to position 2, teleport it to position 8, then haul it to position 10.
The total distance requiring the tractor is therefore 1 + 2 3.
Problem credits: Brian Dean
以上就是关于【USACO 2018 February Contest, Bronze Problem 1. Teleportation】的解答,如需了解学校/赛事/课程动态,可至翰林教育官网获取更多信息。
往期文章阅读推荐:
【十问十答】别盲目刷竞赛!10 个核心问答,理清国际赛事规划底层逻辑!
【10问10答】参加了所谓的“高含金量”国际竞赛?抱歉,名校招生官根本不买账!

© 2026. All Rights Reserved. 沪ICP备2023009024号-1