Блог пользователя N29

Автор N29, 18 месяцев назад, По-английски

In last contest I finally achieved Master. It still feels a bit surreal to see the orange next to my name after so many contests and late nights.

This blog is inspired by reirugan blog. So I decided to write something similar — a list of things I still don’t know.

  • Every single thing in this list except $$$ \downarrow $$$

  • Li-Chao Segment Tree

  • Segment Tree Beats

  • RMQ in $$$ O(n)/O(1) $$$

  • Wavelet tree

  • Mergesort tree

Becoming Master doesn’t really require knowing super advanced or obscure algorithms. You just need to keep solving problems, learning from them, and being consistent.

(Like my Brother said: You become BoxMaster XD)

  • Проголосовать: нравится
  • +9
  • Проголосовать: не нравится

»
18 месяцев назад, скрыть # |
← Rev. 4  
Проголосовать: нравится +16 Проголосовать: не нравится

Congratulations! But I want to ask a question: I know 90% of https://codeforces.me/blog/entry/141214 but I'm still not Master. Am I doing something wrong?

UPD: here is a list that i don't know in https://codeforces.me/blog/entry/141214:

  • Binary search trees, including treaps
  • How to compute binomial coefficients of large numbers quickly
  • Fast fourier transform

UPD2: here is a list that i know in https://codeforces.me/blog/entry/92248

  • Li-Chao Segment Tree
  • Leftist heap
  • $$$k$$$-th shortest path
  • Online convex hull in 2D
»
18 месяцев назад, скрыть # |
 
Проголосовать: нравится +11 Проголосовать: не нравится

Congratulations! My list is quite bigger than yours.

  • Chinese Remainder Theorem

  • Fast Fourier Transform

  • Flows except Ford-Fulkerson

  • Every single thing in this list except ↓

  • Li-Chao Segment Tree

  • Some Segment Tree Beats

  • Mergesort Tree

»
18 месяцев назад, скрыть # |
 
Проголосовать: нравится +8 Проголосовать: не нравится

As a master, the only thing I know is RMQ in $$$O(n)/O(1)$$$.

You don't even need that though. Problem solving is much more important than knowing algorithms that you will almost never use.

»
18 месяцев назад, скрыть # |
← Rev. 2  
Проголосовать: нравится +28 Проголосовать: не нравится

if i make a list of things i heard of and know nothing about it probably wouldnt fit in a single blog

»
18 месяцев назад, скрыть # |
 
Проголосовать: нравится +2 Проголосовать: не нравится

Are you sure you don't know what MergeSortTree is?) It's just a SegmentTree with sorted array segments at its nodes.

»
18 месяцев назад, скрыть # |
 
Проголосовать: нравится +20 Проголосовать: не нравится

Last contest I finally lost CM title. It still feels a bit unreal to see the blue next to my name after so few contests and late dota nights.

This comment is inspired by the blog under which it appears. So I decided to write something similar — a list of things I know:

  • std::sort()

  • std::lower_bound()

Losing CM title doesn’t really require knowing super advanced or obscure algorithms. You just need to keep playing dota, unlearning things, and being consistent.

»
18 месяцев назад, скрыть # |
 
Проголосовать: нравится +18 Проголосовать: не нравится

"If you know at least 3 of these things and you are not red — you are doing it wrong." Oh no, that seems like five things :(

I'm just kidding :) congrats on Master! Hopefully I'll be there next!