How to write a blog on codeforces?

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

How to compute the minimum number of paths in a directed graph and each vertex is traversed exactly 1 time?