Guess.Who's blog

By Guess.Who, history, 3 days ago, In English

Hey Guys

I've been practicing on solving data structures problems, and as you know, to solve data structures problems, you need to know those data structures, and every time i search for a new one, i find nothing but stl structures like set and map

I already know : Z-Array, String Suffix Structure, Segment Tree, BIT, Trie, Graph, Merge Sort Tree, Binary Search Tree And now i am learning Palindromic Tree

Is there anything new you can provide to me ?

Thanks in advance

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

»
3 days ago, # |
  Vote: I like it +8 Vote: I do not like it

dsu, sqrt decomposition, treap, sparse table...

»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

This should last you your entire CP career: https://codeforces.com/blog/entry/55274?f0a28=1

»
3 days ago, # |
Rev. 4   Vote: I like it +84 Vote: I do not like it
  • Extended persistent dynamic implicit Li Chao tree
  • Extended lazy dynamic persistent segment tree beats
  • 3D Convex Hull in 3D
  • Dominator Tree
  • Voronoi Diagran
  • Vorona Diagram
  • Suffix tree
  • Matroid intersection
  • Maximum bipartite matching
  • Number theoretical transform
  • Link-cut tree
  • Persistent lazy treaps
  • Merge Sort Tree
  • Mo's Algorithm in 3D
  • SQRT Decomposition
  • Reachability tree
  • RMQ in O(n)/O(1)
  • Generating functions
  • The Clock Algorithm
  • Chinese remainder theorem
  • Extended Euclidean Algorithm
  • Divide and Conquer DP
  • Suffix Automaton
  • Gauss Elimination
  • Convex Hull trick
  • Half plane intersection
  • DFS Tree
  • BFS Tree
  • Dinic's Algorithm Optimized
  • Farach Colton and Bender
  • HLD
  • Sprague-Grundy
  • Errichto's trick
  • Wavelet Tree
  • Disjoint Sparse table
  • 2D Lazy Segment tree
  • Polynomial segment tree
  • Fenwick tree
  • Augmented DSU
  • DSU Segment tree
  • Cartesian tree
  • Permutation Tree
  • Knuth Optimization
  • Bounded Knapsack
  • Subset Sum Convolution
  • Trie
  • Meet in The Middle (I would like to thank mesanu for teaching it to me when I visited the beautiful Chisinau during tst.)
  • General weighted matching
  • Purice's trick
  • Global Minimum Cut of Dynmaic Start Augmented Graph
  • Chordal Graph Recognition
  • Rudy's trick
  • Persistent Data structures
  • Suffix Array in O(n)
  • Radewoosh trick
  • Parallel binary search
  • Schreier–Sims Algorithm
  • K-th Root of a Permutation
  • Lindstrom–Gessel–Viennot lemma
  • Fractional knapsack
  • Registers trick
  • Mos on Tree
  • Sweepline
  • 2D Sparse table
  • D'esopo Pape
  • Randomized heap
  • Tarjan's off-line algorithm for Strongly Connected Components
  • Kosaraju's algorithm for Strongly Connected Components
  • Min cost Max Flow
  • Dynamic connectivity
  • DSU Rollbacks

Marinush

  • »
    »
    3 days ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    you forgot mesanu's trick smh...

    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it +15 Vote: I do not like it

      I am sorry.

      Marinush

      • »
        »
        »
        »
        3 days ago, # ^ |
          Vote: I like it +11 Vote: I do not like it

        I hate you

        • »
          »
          »
          »
          »
          3 days ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Success makes so many people hate you. I wish it wasn't that way. It would be wonderful to enjoy success without seeing envy in the eyes of those around you.

          Marinush

  • »
    »
    3 days ago, # ^ |
    Rev. 2   Vote: I like it +8 Vote: I do not like it

    Sir you forgot smenu lu oncescu, smenu lu mars, smenu lu batog, smenu cu timpu, smenu lu greedy aleator, smenu de la batch, smenu de la iens, smenu de la saumat, smenu de la tamio.

»
3 days ago, # |
  Vote: I like it +14 Vote: I do not like it
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Sa nu iti fie cu suparare, dar ar fi optimal daca ai vorbi doar cand ai ceva cu adevarat util de adaugat la conversatie.

»
3 days ago, # |
  Vote: I like it +10 Vote: I do not like it

fyi I don't know palindromic tree

  • »
    »
    3 days ago, # ^ |
      Vote: I like it +27 Vote: I do not like it

    that'd explain why you're stuck at grandmaster.

    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      "stuck at grandmaster"

    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      I want to be stuck at grandmaster :D

      • »
        »
        »
        »
        2 days ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Ma indoiesc ca vei ajunge la asa performanta. Totusi iti recomand sa citesti asta ca sa intelegi de ce.

        Marinush

        • »
          »
          »
          »
          »
          2 days ago, # ^ |
            Vote: I like it +5 Vote: I do not like it

          Sir, please stop using my natal language to belittle people

        • »
          »
          »
          »
          »
          2 days ago, # ^ |
            Vote: I like it +5 Vote: I do not like it

          Nu voi ajunge atât de departe și știu asta. Spuneam doar că a fi blocat în Grandmaster nu este chiar atât de rău.

  • »
    »
    2 days ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    That is why you don't have gold in RMI

»
3 days ago, # |
  Vote: I like it +64 Vote: I do not like it

this blog is the perfect representation of why people say cyans implement link cut trees better than reds