MikhailRubinchik's blog

By MikhailRubinchik, 3 years ago, translation, In English,

Regards to cf-community!

Imagine that you are a fan on one of ACM ICPC. Teams are in one large hall. The contest is about to start, organizers pronounce ceremonial speeches followed by pretentious music. You anticipate something enormous. Here it is! The contest has started. You search for the link to results. And cannot find it. Organizers are acting slowly … and you find your team, count the number of balloons they and their main competitors have, assess the places they can take. Not too convenient, isn’t it? And just think about spectators coming to ICPC WF. Of course they have a link to the results. But it means almost nothing for a usual spectator. To eliminate this a broadcast (or ICPC Live) appeared several years ago. ACM ICPC is becoming a show. This year we are responsible for ICPC Live and we have tried to do our best :) So, what interesting you can see?

I do not want to write long stories, just give you some interesting facts.

  1. For the first time in ICPC history the broadcast will be in Russian (and of course, in English :) )

  2. Broadcaster is Panorama. This company was founded 3 years ago to broadcast Sochi 2014 (before that there was no broadcaster of such level in Russia). They came back not long ago with a unique experience. By the way, they have already broadcast Ural Championship 2013.

  3. The anchor is Roman Elizarov. Everybody knows him as a leader of the team preparing problems for NEERC and as local director of ICPC WF 2013.

  4. You will see fascinating videos prepares specially for ACM ICPC 2014. Here is an example :)

  5. Around 100 people prepared this broadcast involving over 40 guests. 10 kilometers of cables, long-focus lenses and a lot of other things have been used to prepare a broadcast :)

Tomorrow follow the link.

As the broadcast is not on yet, you can read news about preparation to ACM ICPC and ACM ICPC 2014 itself at our web-site

P.S.And Russian – speaking community may see our announcement on habrahabr.

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

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

The video you made illustrating the rules of the contest is awesome ! =) Good luck tomorrow

»
3 years ago, # |
Rev. 2   Vote: I like it -12 Vote: I do not like it

I am bad about this contest

»
3 years ago, # |
  Vote: I like it +1 Vote: I do not like it

St. Petersburg State University will be the champions

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    what an awesome prediction!!
    are u the ACM-ICPC version of Paul? :D

»
3 years ago, # |
  Vote: I like it +45 Vote: I do not like it

Problem E: http://community.topcoder.com/stat?c=problem_statement&pm=8282

not even slightly modified.

Too bad that even ICPC finals are reusing problems from past. Are we slowly running out of original ideas in programming contests?

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

problem K from this finals is exactly this problem http://acm.tju.edu.cn/toj/showp3585.html that appeared in USACO, even with similar bounds... WTF is that?

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    :(

    There is no way this problem could be original because the statement is way too simple.

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      but wtf, the problem is the same, this is unfair. American teams and IOI guys have advantage because of this...

      • »
        »
        »
        »
        3 years ago, # ^ |
          Vote: I like it -9 Vote: I do not like it

        I guess a lot of contestants were in high school, so could see this problem in February 2010.

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

          I am pretty sure that lots of contestants knew this problem. Problem C and D are much easier than K but lots of teams started with K which explains a lot

      • »
        »
        »
        »
        3 years ago, # ^ |
          Vote: I like it +69 Vote: I do not like it

        Probably judges didn't know about those exact problems but at least they should have suspected that the idea of the problem can't be original

        What is more surprising is that one of the judges said that they expected winner to solve 6 problems. WTF really? Why bring 12 problems if you don't expect more than half to be solved? And why don't discard those problems that seem too unoriginal?

        Glad that I am not participating but it will only get worse in future.

  • »
    »
    3 years ago, # ^ |
      Vote: I like it -6 Vote: I do not like it
    • I sorted the intervals (say A is this sorted array). Then broke each segment into two points with the information (pos,right,idx,flag) ,inserted in a new array B and sorted this array to run a sweep line.
    • (pos,right,idx,flag) = means
    • pos = position of the current point,
    • right = ending point of this current point (if its already an ending point right = -1, other wise right = ending point of the point that starts with pos).
    • idx = current point belongs to the idx — th element of sorted A array.
    • flag = +1 if its a starting element , -1 otherwise
    • Now I run a sweep line with the array B . If current point is a finishing point I do nothing. Otherwise I do the following :-
    • The segments that covers our current point is considered and amongst those I take the left most point that covers my current point. My segment tree indexed by ending point
    • keeps track of the starting points, and a value that stores number of segments needs to reach the left most point. Then if, the difference between left most point I reached from the current point and the ending point of our current starting point is >=N I update my result.
    • But before updating I use a binary search search for following purpose:-
    • 5 3
    • 1 3
    • 3 4
    • 4 7
    • If we consider the third segment , leftmost point we can reach is 1 but its enough if we can reach at 3 because 7-3+1=5. From Binary search on array A I find the position of 3 and subtract its result from our current result.
    • I am stuck on this problem all day, Got 15+ WA , Sorry for extremely poor English. Please pardon me :(
    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Sorry, I forgot the main purpose of my post. Why my idea is wrong? Or is it really wrong idea or I have bug in my code :( . please Help anybody.

»
3 years ago, # |
Rev. 2   Vote: I like it +28 Vote: I do not like it

Where are screencasts?

Why only some talks, nothing about contest process and analyzing team submits&reaction :(

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +19 Vote: I do not like it

    Agree with you. The most boring broadcast I've ever seen :(

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +19 Vote: I do not like it

      yes, it's like having olympic games and instead of watching the contestants you watch the sponsors. The people there are so bright yet they can't seem to get the idea how to make the competition interesting. To me it would be waaaay more interesting if they had some people who checked the code submisssions regularly and say where the teams have bugs, which team is close to solving etc.

»
3 years ago, # |
Rev. 3   Vote: I like it +33 Vote: I do not like it

So just for curiosity decided to code very first greedy idea in I

Passed more than half of the tests

Added randomizing point order to use more time — Accepted

Poor contestants who try to solve it properly

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    As conclusion: 4 geoms, K and E already were on contests, I can be solved with random stuff.

    O. K.

  • »
    »
    3 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    could you post your solution? i am interested in this kind of solutions

»
3 years ago, # |
  Vote: I like it +23 Vote: I do not like it

Good news for russian fans: Spb SU has solved 7 problems :) Great job!

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    Moscow should also have 7 but slightly worse penalty time

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +41 Vote: I do not like it

      Looks like 1398 (MSU) vs 1359 (SPbSU)

      • »
        »
        »
        »
        3 years ago, # ^ |
        Rev. 2   Vote: I like it +8 Vote: I do not like it

        hmm people are already congratulating MSU in twitter..

      • »
        »
        »
        »
        3 years ago, # ^ |
          Vote: I like it +32 Vote: I do not like it

        Outside the contest, Petr, tourist and meret's team solved 7 problems with 1244 penalty minutes.

  • »
    »
    3 years ago, # ^ |
      Vote: I like it -24 Vote: I do not like it

    seriously you had to spoil it?

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

      Russian speakers have listened it from Broadcast

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

        so did i, but gladly i didn't understand a thing they said.

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

Didn't know that North Korea take part in ICPC Oo

»
3 years ago, # |
  Vote: I like it +7 Vote: I do not like it

i hope the guy from last year's closing ceremony will announce the winner with his "congratulations" algorithm

»
3 years ago, # |
  Vote: I like it -7 Vote: I do not like it

where is the board i want to see it can any one give me a link ?

»
3 years ago, # |
  Vote: I like it +51 Vote: I do not like it

Does anyone have the final scoreboard? I'd like to know where is my university's team in the final standings.

»
3 years ago, # |
  Vote: I like it +40 Vote: I do not like it
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I believe that next year's ICPC WF will be even more exciting if tourist join in the fight:)

»
3 years ago, # |
  Vote: I like it +44 Vote: I do not like it

congratulations to SPb SU 4 (yeputons, PavelKunyavskiy, and Dmitry_Egorov) for winning the ACM-ICPC World Finals 2014 :)

in case anyone missed the finale:

  • all submissions upto third place judged. SPb in second place and Moscow in first place, both with 6 solved problems (and both with 1 more pending).
  • SPb's pending problem got accepted, and they overtake Moscow to become first place.
  • then Moscow's pending problem got accepted, but they were unable to overtake SPb (due to higher time penalty).

extremely thrilling until the very last minute! i absolutely loved it :))

»
3 years ago, # |
  Vote: I like it +39 Vote: I do not like it
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Where will the next world finals?

»
3 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Will there be an editorial/problem analysis put up on the ICPC website for the contest?

  • »
    »
    3 years ago, # ^ |
    Rev. 2   Vote: I like it +19 Vote: I do not like it

    Usually Per Austin posts a brief analysis every year but this year haven't seen one from him. Found analysis of 6 problems on bmerry's blog

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

Does anyone know who were the problem setters this time?

  • »
    »
    3 years ago, # ^ |
    Rev. 2   Vote: I like it +4 Vote: I do not like it

    As far as I know, possible problemsetters belong to a not so large group of ICPC judges or something like that and that is not changing.

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      misof answered the question on Quora. World Finals Judges for 2014:

      • Per Austrin (Per)
      • Osman Ay
      • Babak Behsaz
      • John Bonomo
      • Walter Guttmann
      • Greg Hamerly
      • Martin Kacer
      • Derek Kisman (snapDragon)
      • Shahriar Manzoor
      • Jo Perry
      • Dick Rinewalt
      • Matthias Ruhl
      • Stan Wileman

      The Brochure for the 2012 World Finals gives some information about the Judges (Page 37).

»
3 years ago, # |
  Vote: I like it +27 Vote: I do not like it

Hat-trick for Russia. Three consecutive world cup wins and china seems to be the only nation who is constantly challenging them. Congrats to both nations for stellar performances.

»
3 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Where are screencasts? Why say nothing about contest process ?

»
3 years ago, # |
  Vote: I like it -9 Vote: I do not like it

This is Final Standings : >>>>>>>>>