Joshc's blog

[Screencast] Somehow getting top 3 in Codeforces Round 888 (Div. 3)!!!
By Joshc, history, 3 years ago, In English

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!

  • Vote: I like it
  • +138
  • Vote: I do not like it

Comments Comments (13)
| Write comment?
»
3 years ago, hide # |
← Rev. 2  
Vote: I like it -22 Vote: I do not like it

Congratulations! I hope one day I'll also be top 5 in div. 3 too.

→ Reply
»
3 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Congrats Josh, your speed is just mindblowing!

→ Reply
»
3 years ago, hide # |
 
Vote: I like it +22 Vote: I do not like it

Awesome. Congrats!

→ Reply
»
3 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

congrats!

→ Reply
»
3 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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.

→ Reply
  • »
    »
    3 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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.

    → Reply
»
3 years ago, hide # |
 
Vote: I like it +14 Vote: I do not like it

bruh wdym somehow, you were #1 on leetcode smh

→ Reply
»
3 years ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

Since Golovanov399 FSTed, you are in top 3!

→ Reply
»
3 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Joshc (previous revision, new revision, compare).

→ Reply
»
3 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Congratulations!

→ Reply