1993A — Question Marks
Video
1993B — Parity and Sum
Video
1993C — Light Switches
Video
1993D — Med-imize
Video
1993E — Xor-Grid Problem
Video
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
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！