Help needed for a problem based on Subtree Queries on tree

Revision en2, by _Enginor_, 2021-11-21 15:02:45

Link To Problem

Can anyone give some ideas about how can this problem be solved using Segment Trees OR any other data structure.

I build an euler tour of the tree in which each node is pushed twice.Then the subtree of any node is a range in the euler tour array. Now I want an idea about what to store at each node in segment tree and how to perform merge operation.

I have already spent more than 3 hours on this problem but I could not figure out any approach. Also I am unable to understand the editorial given :(.

Any help is appreciated !.


  Rev. Lang. By When Δ Comment
en2 English _Enginor_ 2021-11-21 15:02:45 243
en1 English _Enginor_ 2021-11-21 14:56:57 521 Initial revision (published)