Editorial for CTU Open Contest 2017 - Forest Picture

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.

Naive solution sufficed – prepare 2D array full of dots and for each tree in the input, loop through each character it consists of, and if the character is in visible part of picture then place it in the array
There were no overlaps allowed, not even of their bounding boxes
This approach runs in $\mathcal O(M^2 + N)$ ~\mathcal O(M^2 + N)~ time

*********
*_o_^_o_*
*../|\..*
*.._|_..*
*********

Comments

There are no comments at the moment.