## Editorial for DMOPC '18 Contest 2 P3 - Thanksgiving Feast

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:

For the first two subtasks, compute the distances from each of the buildings to any of the other buildings. This can be done by BFSing from each of the buildings as the source. Then the answer is .

**Time Complexity:**

For the last subtask, instead BFS from and . The answer is .

**Time Complexity:**

## Comments