| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
I've somehow managed to get 3rd place in the Div3, a new career high!!! If I had done F and G in the correct order, I would've saved 19 penalty, rip (although my rank wouldn't have improved).
Anyway, to celebrate, I've posted my screencast / explanations here. Hopefully people enjoy!
Congratulations! I hope one day I'll also be top 5 in div. 3 too.
Congrats Josh, your speed is just mindblowing!
Awesome. Congrats!
congrats!
congrats! just curious how did you solve F? I used a binary trie but a lot of my friends are telling me that sorting works.
It reduces to finding two elements with the minimum XOR. I also used a binary trie, but you can abuse the property that the two elements with the minimum XOR must be adjacent elements in the sorted array.
bruh wdym somehow, you were #1 on leetcode smh
Since Golovanov399 FSTed, you are in top 3!
Wow! Time to update blog title now, I guess :)
One day I'll learn not to assign a huge number to an int variable, but not today
RIP, but thanks for doing that :) Python superiority!
Auto comment: topic has been updated by Joshc (previous revision, new revision, compare).
Congratulations!