depstein / programming-competitions Goto Github PK

It would be cool if we could share our solutions or if there were some online.

For the Cave Crisis problem for competition 10-11-14 UW qualifier, one of the sample inputs is this:
964 4
10 144 381 121 248 1 265 12 71 101 59 92 53 227 -104 379 -50 480 172 388 233
5 146 -64 171 -284 280 -347 415 -289 328 0
5 351 139 225 -24 338 -75 579 93 456 183
7 119 131 21 -127 123 -207 104 -262 161 -226 328 -48 328 120
and the corresponding sample output is
64.73

However, the least y-coordinate of any obstacle is -347, which means r2d2 will be able to make it if his radius is (964 / 2 - 347) / 2 = 67.5, so the output should be at least 67.5 (which according to my algorithm is the correct answer).