Mickey has been enjoying sailing on the local lake, but now it's the end of the day and it's time to go back to dock to return the rental boat on time.
Find the shortest path from its current location to the one remaining egress point over water, staying within or passing along the coastline of the lake.
The lake is represented as a simple, potentially concave, polygon having vertices at integer coordinates, and with no $$$3$$$ consecutive vertices being collinear.
A triangulation of the lake into $$$(n-2)$$$ pieces is also provided.

Illustration of Sample Input 1.
The given triangles correspond to the polygon, thus cover the lake without any self-overlaps, holes, or other hazards.
Output the shortest distance from point $$$a$$$ to point $$$b$$$ without exiting the lake.
The output must be accurate to an absolute or relative error of $$$10^{-6}$$$.
8 3 70 010 010 22 22 410 410 60 61 2 31 3 41 4 84 5 85 7 85 6 7
18.246211251
14 1 9-3 -1-1 -1-1 -31 -31 -13 -13 11 11 35 35 5-1 5-1 1-3 11 2 146 8 133 4 59 12 138 9 136 13 142 5 145 6 1410 11 122 3 59 10 126 7 8
5.6568542495
| Name |
|---|


