Confusing bitsets

Revision en1, by nkamzabek, 2019-11-01 14:42:34

Despite I am big fan of bitsets, I don't even know what is the exact time complexity. I think operation OR, XOR and etc. works in

Unable to parse markup [type=CF_MATHJAX]

, the explanation is that solutions which used it got AC. But on the other hand, I have read in blogs that there would be

Unable to parse markup [type=CF_MATHJAX]

instead of $$$64$$$. Please help me, what is the exact time complexity for each function and which factors it depends on and explain work principles.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English nkamzabek 2019-11-01 14:42:34 439 Initial revision (published)