olimp_structures

1. Dymanic Graph solve Fully Dynamic Connectivity Problem online by O(log^2 n) for each query

2. Set is based on AvlTree and almost equal std::set, but faseter in 4 times

3. Fixed Set is realisation of Perfect Hash function

4. "Map for poor" is standart runtime analysing problem.

   • Insert query by O(log n) amortized
   • Contains query by O(log^2 n)
   • No erase

5. Inplace merge sort using additional O(log n) memory for recursuion.

6. Radix sort can sort 10^7 elements in 0.5s