1993A — Question Marks
Video
1993B — Parity and Sum
Video
1993C — Light Switches
Video
1993D — Med-imize
Video
1993E — Xor-Grid Problem
Video
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 161 |
| 2 | maomao90 | 160 |
| 3 | awoo | 159 |
| 4 | atcoder_official | 157 |
| 5 | -is-this-fft- | 155 |
| 5 | nor | 155 |
| 7 | adamant | 153 |
| 8 | maroonrk | 152 |
| 8 | Um_nik | 152 |
| 10 | djm03178 | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/11/2024 10:55:03 (k2).
Desktop version, switch to mobile version.
Supported by
now not chill kids
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！