1993A — Question Marks
Video
1993B — Parity and Sum
Video
1993C — Light Switches
Video
1993D — Med-imize
Video
1993E — Xor-Grid Problem
Video
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/21/2026 13:33:23 (g1).
Desktop version, switch to mobile version.
Supported by
wrong video isnt it?
Shayan
It is supposed to be the solution discussion of Codeforces Round 963. Did I mistakenly add another video somewhere?
Problem names/links are from other contest
Oh, you are right. Thanks.
Ig only the titles are misplaced.
Thanks. Fixed.
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~~
i think you are looking for this.
COOL
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).
oh i know，thanks
you can do it with compression and fenwick/segment tree.
thanks！