IOM 2016, Блиц — Задача 38

Olympiad of Metropolises, Moscow. Blitz Contest, September, 5 · 5 септември 2016 г.

Условие

Jekardah Mayor, held a party in a city park. At this party there are $N$ people. Because he wants to make a surprise, Mayor will select one of the party guest to cooperate.

During the party, the guests will be spread in the park of size $R * C$ blocks that is very large. From their position at that time, Mayor Jekardah will choose one person, that is when he scream, the voice can be heard by all of the people in a shortest time. The sound of people shouting 8 propagating direction of the wind with a speed of 1 block per second. In the following picture, sound propagation from person A to person B is as far as 5 blocks.

The following 10 lines contain two integers $X_i$ and $Y_i$ which is the position of the i-th party guest.

Determine the minimal time when the last person to hear sound of chosen guest by Mayor Jekardah (first of all guess who was chosen).

5 3

1 3

15 6

19 3

2 7

5 7

20 10

16 5

17 9

3 4

Решение

---

Оригинал в Архива: blitz.pdf