I managed to take 2413th place, which is an anti-record for my entire programming career. My thoughts on G were not entirely wrong, and a small miscalculation affected my solving process; and also, even if I had managed to solve G, it would have been so late that the penalty simply wouldn't have been worth it.
Learn to not do like I did! https://youtu.be/C5UOOzLjwrk
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
your face looks kinda cursed ngl
o7
By the way, I think I saw a problem about 2413
What gives! And what was the problem?
Something like "given a permutation, count the number of $$$i \lt j \lt k \lt l$$$ so that $$$p_k \lt p_i \lt p_l \lt p_j$$$" or maybe count the sum of those numbers over all subsegments or something like this
1693D - Decinc Dividing
Twin!