Limits: 6s, 512 MB
You are given a set of points P, and a set of target points M in 2D space. For each point M[i] in M, find the minimum angle at M[i] such that all the points P[i] in P are contained within this angle. If the angle is not less than 180 degrees, then you just have to output “TOO WIDE”.
This is a companion discussion topic for the original entry at https://toph.co/p/cover-the-points