Given n circles in 2D coordinate system (their centers and radius, circles can overlap). You are also given the position of Runu. What is the minimum distance she needs to walk to get out of all the circles. More formally, if Runu's position is P and there is a point Q such that Q is out of every n circles, you have to minimize the euclidian distance of Pand Q for all such Q's .

This problem is out of judges, came to my mind. What is the tight bound of n then? If anyone had seen problem like this before or thought something like this, please do share.