what's time complexity of swap operator of 2 bitset?

Revision en1, by JioFell, 2018-10-22 18:09:43

In this problem(1070L - Odd Federalization), I used gaussian elimination (O(n^3)) but I have used bitset because I think it will be faster. Finally, I got AC (44701036) but I still don't understand all details of bitset's complexity. Thanks for reading my blog

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English JioFell 2018-10-23 17:43:03 2
en1 English JioFell 2018-10-22 18:09:43 316 Initial revision (published)