JioFell's blog

By JioFell, history, 4 months ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it  
  • +1
  • Vote: I do not like it  

By JioFell, history, 8 months ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it  
  • -24
  • Vote: I do not like it