yoshi_likes_e5's blog

By yoshi_likes_e5, history, 8 months ago, In English

I have a question regarding Div 3/4 editorials: Why isn't range trees being used in any problem except last Div 3 problem? Many problems seems more intuitive to do with range trees than with sets. No need for iterators and is certainly more flexible, too. One such example I have seen is 1374E2 - Reading Books (hard version), where two Fenwick trees with binary lifting is, in my opinion, more direct and easy to understand than the editorial's solution.

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

»
8 months ago, hide # |
Rev. 2  
Vote: I like it 0 Vote: I do not like it

Because in CodeForces, advanced data structures are always considered as the hardest thing. So the problem providers tried their best to avoid advanced data structures.

PS: simple sets are not considered as advanced data structures.