ZCO17002 Optimization Problem

[sharathnirmala]

I am getting SIGABRT or SIGSEGV or TLE for this problem. Any idea on how I can improve my solution. I have looked through other people’s solutions but I couldn’t understand them. So please any suggestions.
Problem Link : CodeChef: Practical coding for everyone
My Solution : CodeChef: Practical coding for everyone

[infinitepro]

ZCO17002-Editorial

PROBLEM LINK: Practice Editorialist: Adithya Dsilva DIFFICULTY: EASY PREREQUISITES: Sorting, Arithmetic progression, Pair (its equivalent in your language), Dynamic array PROBLEM: You are given a grid of size N*M, where each element of the grid \in \{E,W,B\}. Note that E corresponds to ‘ . ‘ in the original question and has been changed for better readability. You are given the location of all W and B cells. All other cells are E cells. The ray-distance of an E cell is defined as the dista…

You might find this helpful. Also, please search for the editorials of zco/inoi problems (or any problem in that matter) and post your doubts in the comments section below the editorial. For zco/inoi problems you can always ping me for any help.

[sharathnirmala]

Thank you very much, I was unaware of the editorials for the ZCO problems.