当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3319:Catch The Heart

题目描述
Do you know Popeye? He likes spinach(菠菜) very much. Maybe you have played some games about him. Now here comes one game.

There are many boards, on one board there is a heart, Popeye wants to catch the heart and send it to his GF, Oliver, so that, she will be happy.

At the beginning, Popeye is on one board, and the heart is on another board. Every board is described as h, l, and r, the height, the left end and the right end. You can look it as a line (l, h) (r, h) in XY coordinate system. Popeye can walk on the board, jump from one board to another.

Notes:
1.He can walk on a board 1 unit per second.
2.He can only jump vertically(垂直地), and it takes 1s for each jumping.
3.He can jump only 1 unit high, so that he can jump only if the difference of the boards’ height is 1.
4.He can only jump up to the left or right point of the board.
5.He can only jump down from the left or right point of the board.

You can look the picture:

The problem is, find the shortest time to catch the heart.
输入解释
The first line of the input contains an integer T (T <= 20) which means the number of test cases. For each case, first line is an integer m (2 <= m <= 10000) which means the number of the boards. Then comes two lines, the first line contains h0, l0, r0, p0 (l0 <= p0 <= r0), which mean the information of the board and the position that the heart on it. Next line contains h1, l1, r1, p1 (l1 <= p1 <= r1), which mean the information of the board and the position that Popeye on it. Then comes m-2 lines, each contains hi, li, ri mean the ith (2 <= i < m) board’s information.

There is no common point or common parts for every two boards.
All inputs are integers, for each board, 0 <= h <= 10000, 0 <= l < r <= 100000000.
输出解释
For each case, output the shortest time to catch the heart if Popeye can catch it, otherwise output -1.
输入样例
3
3
3 4 5 5
1 0 10 0
4 1 2
2
1 1 99999999 1
0 0 100000000 100000000
5
4 0 5 0
0 0 5 0
1 5 10
2 6 15
3 5 10
输出样例
-1
100000000
24
来自杭电HDUOJ的附加信息
Author AppleMan
Recommend wxl

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3319

最后修改于 2020-10-25T23:02:18+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)