Hi guys.
I am having trouble understanding the tutorial to this problem in the recent Division 3 Contest.
https://mirror.codeforces.com/contest/1335/problem/F
Can anyone who has solved this problem explain the solution better?
I'm not saying explanation given in tutorial is bad but if someone could expound more, would definitely help.
Thanks!
I just placed all n*m robots, then complete $$$2^{24}$$$ moves for all robots in $$$O(n \cdot m \cdot \log(n\cdot m))$$$. After it, in some cells there is possible that more than $$$1$$$ robot: need to keep only $$$1$$$ robot from cell with color $$$0$$$ if possible. Submission