Uzumaki_Narutoo's blog

By Uzumaki_Narutoo, history, 9 months ago, In English

Hello every one ,wish you are doing great .... can any one explain how does this code doesn't got TLE ?

My idea is:

1-I'm storing all nodes in subtree of u at depth x using dfs time.

2- In every query first I check if I've encountered a query asking about the same nodes then I print answer as I save the ans of every query else then I iterate over all strings at depth d[i] + x at subtree of u and find number of distinct strings using set.

thanks in advance

Read more »

  • Vote: I like it
  • +2
  • Vote: I do not like it