POJ 1113 Wall 凸包
来源:互联网 发布:java打开jdk api 编辑:程序博客网 时间:2024/04/28 09:20
http://poj.org/problem?id=1113
Wall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16323 Accepted: 5243
Description
Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposals to build a beautiful brick wall with a perfect shape and nice tall towers. Instead, he ordered to build the wall around the whole castle using the least amount of stone and labor, but demanded that the wall should not come closer to the castle than a certain distance. If the King finds that the Architect has used more resources to build the wall than it was absolutely necessary to satisfy those requirements, then the Architect will loose his head. Moreover, he demanded Architect to introduce at once a plan of the wall listing the exact amount of resources that are needed to build the wall.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.
The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.
The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.
Input
The first line of the input file contains two integer numbers N and L separated by a space. N (3 <= N <= 1000) is the number of vertices in the King's castle, and L (1 <= L <= 1000) is the minimal number of feet that King allows for the wall to come close to the castle.
Next N lines describe coordinates of castle's vertices in a clockwise order. Each line contains two integer numbers Xi and Yi separated by a space (-10000 <= Xi, Yi <= 10000) that represent the coordinates of ith vertex. All vertices are different and the sides of the castle do not intersect anywhere except for vertices.
Next N lines describe coordinates of castle's vertices in a clockwise order. Each line contains two integer numbers Xi and Yi separated by a space (-10000 <= Xi, Yi <= 10000) that represent the coordinates of ith vertex. All vertices are different and the sides of the castle do not intersect anywhere except for vertices.
Output
Write to the output file the single number that represents the minimal possible length of the wall in feet that could be built around the castle to satisfy King's requirements. You must present the integer number of feet to the King, because the floating numbers are not invented yet. However, you must round the result in such a way, that it is accurate to 8 inches (1 foot is equal to 12 inches), since the King will not tolerate larger error in the estimates.
Sample Input
9 100200 400300 400300 300400 300400 400500 400500 200350 200200 200
Sample Output
1628
凸包周长+圆的周长=围墙的周长
刚刚开始结果用float表示总是WA,换成double后AC!
- POJ 1113 Wall 凸包
- POJ 1113 Wall (凸包)
- poj 1113 Wall--凸包
- poj 1113 Wall 凸包
- poj 1113 Wall-----凸包
- [poj 1113]Wall[凸包]
- poj 1113 Wall 凸包
- POJ 1113 Wall (凸包)
- POJ 1113 Wall 凸包
- poj 1113 Wall (凸包)
- POJ 1113 Wall (凸包)
- Wall(凸包POJ 1113)
- 【POJ 1113】 Wall (凸包)
- poj 1113 Wall 凸包
- POJ 1113 Wall (凸包)
- Poj 1113 Wall [凸包]
- POJ 1113 WALL(凸包-计算几何)
- POJ 1113 WALL (凸包问题)
- 言寡尤,行寡悔,禄在其中矣。
- 恒心
- instanceof和typeof都能用来判断一个变量是否为空或是什么类型的变量。
- 感受母爱
- c++中冒号(:)和双冒号(::)的用法
- POJ 1113 Wall 凸包
- js 判断对象为空或者不是对象的方法
- zoj 2657 Appointment 扩展欧几里得
- 完美生活
- Linux下磁盘设备文件(sda,sdb,sdc….)变化问题
- 又是加班又是跳槽 乱
- ssd3 Multiple-Choice Quiz 2
- 对网页中超链接动态显示相关描述
- 杂感