Getting WA on tc 6 in problem D. Water Tree (https://codeforces.com/contest/343/problem/D)

Revision en1, by asqre756, 2021-07-07 13:08:18

i am unable to figure out my mistake in implementation of https://codeforces.com/contest/343/submission/121547727

used euler tour technique and segment trees for query 1: i have used lazy propogation to update all the nodes and also checked if any node in subtree of node is empty then made the parent of node empty for query 2: i have updated the node and made it empty for query 3: i have checked if all the nodes in subtree of given node is filled then printed 1 else 2

but can't fugure out my mistake getting WA on tc 6

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English asqre756 2021-07-07 13:09:44 33
en1 English asqre756 2021-07-07 13:08:18 622 Initial revision (published)