Hi, I am getting TLE in Problem R — Walk Link to the question. Link to code

Hi, I implemented the problem 100883E - xortion using tries and am not able to figure out my mistake. Would appreciate if someone could help me out. Thanks in advance. Here is my submission 63671101

Given the xor of n numbers,I need to find those n numbers (all positive) such that their sum is minimum. I thought on the lines of minimising the bitwise and of the n numbers, but couldn't come up with a solution. Thanks in advance

Hi, Could someone please provide a good online resource from where I can learn techniques to solve questions involving range queries. Thanks in advance.

My logic was the following. I created a frequency array, sorted it in decreasing order, considered its first k elements as the answer is obviously a subset of this. To find until what point I should consider I used the logic that if f[I]< f[0]/2 (found this intuitive) then I don't consider that element.This is my submission 57141020. Would be helpful if someone could provide a test case to prove why what I'm thinking is wrong. Thanks.

Could someone please explain 1149B - Три религии I am not able to understand the approach that is given in the editorial. Thanks in advance.