aropan's blog

Facebook Hacker Cup 2012 Qualification Round
By aropan, 14 years ago, translation, In English

Qualification round page - https://www.facebook.com/hackercup/problems.php?round=146094915502528
Countdown - http://fb.me/1glVt0CnM

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

»
14 years ago, hide # |
← Rev. 3  
Vote: I like it 0 Vote: I do not like it

It's over!

Does anyone have a nice solution for #2, Auction?
I could only find an inelegant O(nlogn) solution, where n is 107.
→ Reply
  • »
    »
    14 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it 0 Vote: I do not like it

    Many people talk about it in russian, but there is no good solutions at this moment. Some people have O(n) solutions as i know, with using minimum query for sufixes and/or prefixes, instead of [L, R] queries.

    → Reply
»
14 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it
Results: https://www.facebook.com/hackercup/scoreboard?round=146094915502528&target=me
→ Reply
»
14 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Please someone check this code and tell me why is this wrong.I thought that once we got a tick it means that I am correct otherwise I would not have wasted those 5 and a half minutes.
→ Reply
»
14 years ago, hide # |
 
Vote: I like it +4 Vote: I do not like it
Contest analysis
→ Reply