Luchtime Div 2. XORSPRT
Why does this solution not pass for the first 3 subproblems?


hi ,
i think because of if(j >= 62) return 0;
you are getting wa,
Even if j>62 you can split the remaining array .

I assumed everthing even after xoring will be less than 2^60 because Ai was less than 1e16 (which has 56 bits). So j cannot be more than that. Is it wrong?

yes ,say we have array of size 10000 which consists only one distinct number,
then j can go upto 5000


Nevermind I got it. I didn’t consider 0. Thanks for the help.

Yes. Thank you.