Help needed for a tree problem

Revision en2, by I_Hate_Swaps, 2022-01-04 22:33:15

Given a Tree with n vertices(1 <= n <= 2e5) and all the vertices have some values assigned to them , we need to find the sum of xor of the paths between all the pairs of vertices. Can Anyone Please Help me in this problem..

If You can't help atleast don't downvote ^_^

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English I_Hate_Swaps 2022-01-04 22:33:15 48 Tiny change: ' problem..' -> ' problem..\n\nIf You can't help atleast don't downvote ^_^'
en1 English I_Hate_Swaps 2022-01-04 22:22:51 253 Initial revision (published)