Shayan's blog

Codeforces Round 963 (Div. 2) — Video Tutorial
By Shayan, 5 months ago, In English

1993A — Question Marks

Video

1993B — Parity and Sum

Video

1993C — Light Switches

Video

1993D — Med-imize

Video

1993E — Xor-Grid Problem

Video
  • Vote: I like it
  • +7
  • Vote: I do not like it

»
5 months ago, # |
← Rev. 3   Vote: I like it -20 Vote: I do not like it

now not chill kids

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

wrong video isnt it?

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there a container that always maintains the elements in sorted order, allows me to access any k-th largest/smallest element in O(log n) complexity, and also supports insertion and deletion of elements in O(log n) complexity? THANKS~~

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    i think you are looking for this.

    → Reply
    • »
      »
      »
      5 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      COOL

      → Reply
      • »
        »
        »
        »
        5 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        but be careful, orderd set is not exactly O(log(n)) but O(log(n) * constant) and this constant may cause a time limit (rarely).

        → Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    you can do it with compression and fenwick/segment tree.

    → Reply