Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: A safe way
Description There is a map of a minefield. The border of the minefield is a polygon which has not got self-intersections or self-contacts. There are two points Input The input consists of several lines. The first line contains four numbers Y, _{A}X and _{B}Y – the coordinates of two given points. The second line contains integer number _{B}N, 3 ≤ N ≤ 100 – the number of vertices of the bounding polygon. Finally, each of the next N lines contains a coordinates X and Y of one polygon vertex, in the counterclockwise order. All the coordinates are integer numbers between −100000 and 100000. The numbers are separated by one or more spaces.Output The output consists of one line containing the length of a shortest safe way, with the accuracy 0.0001. Sample Input 0 0 5 5 4 1 0 3 0 3 2 1 2 Sample Output 7.2361 Source Northeastern Europe 2004, Western Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator