Problem 1883 --Problem A: Freckles

1883: Problem A: Freckles

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $4$ 正确数量 $1$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签

Problem A: Freckles

In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through.

Consider Dick's back to be a plane with freckles at various (x,y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence of connected lines from any freckle to any other freckle.

The first line contains 0 < n <= 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the freckle.

Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the freckles.

3
1.0 1.0
2.0 2.0
2.0 4.0
3.41

推荐代码 查看1883 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$4 $ms] AOJ大管家 84398 2017-04-27 15:28:10
内存最少[$960 $KB] AOJ大管家 84398 2017-04-27 15:28:10
第一AC AOJ大管家 84398 2017-04-27 15:28:10
第一挑战 AOJ大管家 84398 2017-04-27 15:28:10

赛题来源/所属竞赛 NA N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛