Editorial for DMOPC '17 Contest 2 P0 - Secrets

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

The distance between two points $(x_0,y_0)$ ~(x_0,y_0)~ and $(x_1,y_1)$ ~(x_1,y_1)~ on a coordinate grid is $\sqrt{(x_1-x_0)^2+(y_1-y_0)^2}$ ~\sqrt{(x_1-x_0)^2+(y_1-y_0)^2}~. We can apply this formula to the distance between the agents and the shady person, and check if it's less than or equal to $D$ ~D~.

Time Complexity: $\mathcal O(1)$ ~\mathcal O(1)~

Comments

There are no comments at the moment.