Блог пользователя pllk

Автор pllk, 12 лет назад, По-английски

Here are my predictions for the IOI 2014 results. They were calculated using information from eduardische's IOI Database and Codeforces API.

Prediction 1 (current rating)

Prediction 2 (maximum rating)

Prediction 1 is based on contestants' current rating on Codeforces. If the rating is unknown, the default rating is 1500. The contestants are sorted according to the ratings, and then the IOI medal allocation algorithm is used. Prediction 2 is calculated in the similar way, but the ratings are maximum ratings.

There are some obvious weaknesses in the model (e.g. many ratings are missing, Codeforces is not IOI), but let's see how accurate the predictions are after the IOI...

Update: changes in teams from Colombia and Egypt

  • Проголосовать: нравится
  • +15
  • Проголосовать: не нравится

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +13 Проголосовать: не нравится

the top 5 are same according to both predictions. let's see if this will come true or not. :)

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +13 Проголосовать: не нравится

Haha, some candidate masters and masters are just unpredictable.

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +5 Проголосовать: не нравится

In my opinion, it would make more sense to call this something like rating statistics instead of results or predictions. The difference in format between IOI and Codeforces/Topcoder is quite considerable so that predicting IOI results based on solely the ratings is pretty much unreliable.

  • »
    »
    12 лет назад, скрыть # ^ |
     
    Проголосовать: нравится +5 Проголосовать: не нравится

    Well, these are predictions of IOI results, not just random statistics of Codeforces ratings. One purpose of this is to see how strong the correlation between IOI results and Codeforces ratings is.

»
12 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

You are too naive.

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +7 Проголосовать: не нравится

Hah, those predictions simply contradict my "rating medal cut-offs" which I stated there: http://mirror.codeforces.com/blog/entry/12950 :D. But this contradicts them in a good way, I mean, it says that achieving a good position in IOI is actually more valuable achievement :).

»
12 лет назад, скрыть # |
Rev. 3  
Проголосовать: нравится 0 Проголосовать: не нравится

I really hope you get accurate with me. LOL

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +15 Проголосовать: не нравится

So glad this prediction wasn't correct for me (got 10th place). I guess high rating in CF guarantees a good place, however not-so-high rating doesn't guarantee a bad place :)

  • »
    »
    12 лет назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    Wow, congratulations on your outstanding performance!

    Could you describe your solution to holiday? Or is anywhere that solution described?

    I thought I solved it in O(n log^2 n) and it seems to give correct answers (using some funny divide and conquer), but because of some weird reason, it works ~10-12 sec for n=3000 :P.

    • »
      »
      »
      12 лет назад, скрыть # ^ |
      Rev. 2  
      Проголосовать: нравится +1 Проголосовать: не нравится

      I am not certainly sure whether my solution is correct, it runs in O(NlogN) but it may be a result of bad tests.

      Author solution may be in the website, since they posted the problems, I am not sure.

      • »
        »
        »
        »
        12 лет назад, скрыть # ^ |
         
        Проголосовать: нравится 0 Проголосовать: не нравится

        I also had an NlogN soln which passed in contest, but now I'm not sure if it actually works.

      • »
        »
        »
        »
        12 лет назад, скрыть # ^ |
         
        Проголосовать: нравится +1 Проголосовать: не нравится

        Excited enough to write about success on a cf (nothing wrong with it), but lazy enough that even combined with that excitement, don't want to post solution :D.

        Unexpectedly it turned out that problemsetter of that problem is my friend :P. Moreover, it turned out that my solution as exactly the same as his and it runs in O(n log^2 n). It doesn't seem that any official solution will be published and even if they will be, it will likely be the solution I already know :P. Since your solution is significantly faster than the author's one, I think it should be interesting to read about it.

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +51 Проголосовать: не нравится

I hope these charts will answered the question "How the CF-rating influence the IOI results?" :)  Large charts: CF(current) -> IOI2014, CF(max) -> IOI2014

»
5 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

It is amazing that the connection between them is stronger than much of you would expect.