同和新媒体矩阵官网同和视频矩阵同和素材矩阵
同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22345_ReturnoftheJedi

2022-5-16 18:21| 发布者: Hocassian| 查看: 27| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506341594400-Problem List-采集的数据-后羿采集器.html

Pro.ID

22345

Title

Return of the Jedi

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22345

AC

0

Submit

0

Ratio

-

时间&空间限制

  • Time Limit: 1000/500 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)

    • 描述

    Luke Skywalker races through the forest on a speeder bike, trying to outrun a patrol of Imperial scouts on Endor. A small moon near a new Death Star, Endor is covered by dense foliage and a thick forest of ancient towering trees. The speeder bike , which Luke stole from an Imperial scout, is an antigravity vehicle capable of speeds of 200 miles an hour. How quickly can Luke reach Princess Leia in the Ewok village?

    The forest is a plane with T trees. Luke's position is specified by a pair of coordinates ( xluke , yluke ) within the plane. The Ewok village has coordinates ( xewok , yewok ). You are to find the shortest travel time from Luke's position to the Ewok village.

    输入

    The first line of input contains T, xluke , yluke , xewok , yewok . T lines follow; each gives the coordinates and diameter of a tree: xtreei , ytreei , dtreei . T is an integer not exceeding 10; coordinates and diameters are real numbers in miles. Trees do not intersect or touch one another.

    输出

    Description

    Luke Skywalker races through the forest on a speeder bike, trying to outrun a patrol of Imperial scouts on Endor. A small moon near a new Death Star, Endor is covered by dense foliage and a thick forest of ancient towering trees. The speeder bike , which Luke stole from an Imperial scout, is an antigravity vehicle capable of speeds of 200 miles an hour. How quickly can Luke reach Princess Leia in the Ewok village?

    The forest is a plane with T trees. Luke's position is specified by a pair of coordinates ( xluke , yluke ) within the plane. The Ewok village has coordinates ( xewok , yewok ). You are to find the shortest travel time from Luke's position to the Ewok village.

    Input

    The first line of input contains T, xluke , yluke , xewok , yewok . T lines follow; each gives the coordinates and diameter of a tree: xtreei , ytreei , dtreei . T is an integer not exceeding 10; coordinates and diameters are real numbers in miles. Trees do not intersect or touch one another.

    Output

    Output is a single real number, to two decimal places, giving the minimum travel time in seconds.

    Sample Input

    2 0.0 0.0 10.0 0.0
    4.0 0.0 1.0
    6.0 0.0 1.0

    Sample Output

    181.13

    Source
    Waterloo Local 2002.1.26

    样例输入

    2 0.0 0.0 10.0 0.0
    4.0 0.0 1.0
    6.0 0.0 1.0

    样例输出

    181.13

    作者


    路过
    雷人
    握手
    鲜花
    鸡蛋
    收藏 邀请

    最新评论

    相关分类

    QQ|Archiver|手机版|小黑屋|同和创作矩阵 ( 粤ICP备20019636号-1 )

    GMT+8, 2025-2-4 23:53 , Processed in 0.037050 second(s), 14 queries .

    Powered by Discuz! X3.4 Licensed

    © 2001-2017 Comsenz Inc.

    返回顶部