Please give link for editorial of poetic word and nested candy boxes from icpc amritapuri regionals 2017.
If anyone knows logic behind how to solve it please give solution.
Refer to the above. As far as I remember, the logic behind the solutions were such: for poetic word, modelling it as max flow/min cut solves the problem.
For nested candy boxes, it was a compression problem where you had to note that 2^x can be greater than 10^{12} pretty quickly.
I fear I cannot be of any help here 