One Point Solution

  • Subscribe to our RSS feed.
  • Twitter
  • StumbleUpon
  • Reddit
  • Facebook
  • Digg

Friday, 20 May 2011

2010's gcj prediction about 2012, how is it going?

Posted on 21:39 by Unknown
In 2010 I wrote some predictions about Google Code Jam 2012. If I use gcj 2011 do the trends seem to agree?


- There will be 5 advancers to on site finals.
- The world champion will win 100 dollars.

Those were just rants about the ever shrinking prizes. They supposedly shrank after the economic crisis but they are not being restored yet, and it is 2011... Everything indicates that 2012 will be as disappointing in these regards as 2011 and 2010.

- Rounds will last for four hours.

Didn't tonight's round last 3 hours? It at least seemed like it. Maybe trying to guess up errors for problem B makes the time feel slower.


- Problems will be 350% more about implementation than they are now.

Still likely. Problem A's values overflew 32 bit integers for no reason. With 2000 test cases, such large numbers were not necessary to prevent time outs. Problem B-small was 100% about making sure to fully find all implementation details hidden under "is consistent with what you have written down so far and the result of all of Sean's previous guesses,"



- Problems will be 10% as interesting as they are now.

A and B seemed to be following the trend towards less interesting problems. It turns out problem B-large was fairly interesting and does not need fancy data structures or premade algorithms but something clever which I have not finished decoding out of the winning submissions. Apparently this trend is getting averted, for now.


- Filtering scoreboard by country will still be impossible.

This limitation will last at least 10 years.

I am not sure what to make about round 1A, it felt lack luster. Most people were only able to submit A-small, A-large and B-small which were not very fun. The other problems were actually interesting but out of reach of the level of most people. I have also detected typos in the statements.


That's not to say that the contest was bad. But I thought that gcj had a larger standard. (Above every other source of contests/tournament). 2008's gcj was one of the best tournaments I can remember. It feels that quality declined a little. It is still better than most tournaments out there, but still... It may have started with the increase in round duration.

I remember gcj 2008 because the problems were all great and distributed correctly among the rounds. Also the huge number of advancers made it clear that google was a very resourceful company. Nowadays it appears that even a medium-sized IT company like topcoder can create more rounds and accommodate travel for more people than Google, it also appears that a Russian Google clone can easily have a contest the same size with equal rewards as the real Google. It sounds like Google does not really care. I know that the Googlers that organized gcj really do care about programming contests, but from their own statements, Code jam was work for their 20% extra work so. It sounds like there is not a lot of real involvement or interest from Google itself.

On the bright side, I didn't advance, that should give me a chance to participate in other rounds, which I hope are better in regards to problem design.
Email ThisBlogThis!Share to XShare to Facebook
Posted in googlecodejam | No comments
Newer Post Older Post Home

0 comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Popular Posts

  • TopCoder SRM 557 - finally
    SRM 557 Explanation for division 1 Easy and match recap. Explanations for div2 easy and div2 medium. It feels like it has been ages since t...
  • SRM 589 Editorial
    I have finished writing the editorial for TopCoder SRM 589: http://apps.topcoder.com/wiki/display/tc/SRM+589 . As you most likely noticed. L...
  • SRM 590 recap and editorial
    Another week another Topcoder match. Not a great day. I had a bad flu and still do. Div1 500: The one with Xor Given a list of cards with nu...
  • SRM 546: relief
    I figured I should post something about this SRM. I've been very busy these weeks because the semester is ending and I tried to win a t-...
  • SRM 526: The killing wait for results
    While I wait for results, here is my perspective on this algorithm contest. It began with issues, it had to be postponed 15 minutes. TC has ...
  • SRM 554 div1 hard: TheBrickTowerHardDivOne
    Link to problem statement We got infinitely many bricks of dimensions 1x1x1 and C different colors. Count the number of towers of size 2x2...
  • SRM 533: Div1 500 MagicBoard explanation
    Finally solved it. It is a nice problem that is worth explaining in a post. You have a grid/board of at most 50x50 cells. Some cells contain...
  • Member SRM 505: Part 1
    So, let me explain a couple of problems from a Topcoder Member SRM that I wrote and never got an editorial. BTW, it was the last member SRM....
  • ListedLinks 2012-02-10
    Saturday Morning Breakfast Cereal comics: Grace Hopper's ghost That Oracle engineer blog post Oracle would really not like anyone to se...
  • Codeforces "Good bye 2013" round
    So it was a special round for coders of both divisions, problems ranged from the super easy problem A to the super difficult problems E,F,G....

Categories

  • acm
  • algorithm
  • answers
  • arenaplugin
  • badday
  • behindthescenes
  • bugs
  • c++
  • censorship
  • codechef
  • codeforces
  • contests
  • crocchamp
  • editorial
  • editorial.srm
  • embarrassing
  • explanation
  • gcj2013
  • gmp
  • goodday
  • google
  • googlecodejam
  • greed
  • groklaw
  • health
  • html
  • httpseverywhere
  • implementation
  • ipsc
  • ispc
  • java
  • kawigiedit
  • kindagoodday
  • lamebook
  • languages
  • lego
  • listedlinks
  • marathon
  • nasa
  • offtopic
  • ouch
  • postmortem
  • postportem
  • practical
  • probably_not_a_good_tip
  • problemsetting
  • programming
  • python
  • quora
  • rant
  • recap
  • slightlygoodday
  • snippet
  • srm
  • stl
  • strategy
  • swerc
  • tco
  • tco12
  • tco13
  • tco2012
  • tco2013
  • ternarysearch
  • topcoder
  • tricks
  • ubuntu
  • uva
  • vjass
  • vkcup
  • wc3
  • zinc

Blog Archive

  • ►  2014 (1)
    • ►  January (1)
  • ►  2013 (141)
    • ►  December (14)
    • ►  November (8)
    • ►  October (13)
    • ►  September (11)
    • ►  August (14)
    • ►  July (15)
    • ►  June (13)
    • ►  May (13)
    • ►  April (12)
    • ►  March (11)
    • ►  February (11)
    • ►  January (6)
  • ►  2012 (94)
    • ►  December (5)
    • ►  October (6)
    • ►  September (8)
    • ►  August (6)
    • ►  July (3)
    • ►  June (5)
    • ►  May (8)
    • ►  April (10)
    • ►  March (20)
    • ►  February (16)
    • ►  January (7)
  • ▼  2011 (51)
    • ►  December (7)
    • ►  November (12)
    • ►  October (5)
    • ►  September (1)
    • ►  August (3)
    • ►  July (4)
    • ►  June (3)
    • ▼  May (7)
      • Thoughts after SRM 507
      • Thoughts after GCJ 2011 round 1
      • 2010's gcj prediction about 2012, how is it going?
      • std::pair is good
      • Bugs that come back to haunt you.
      • Some thoughts after SRM 506.
      • Google code jam qualification round
    • ►  April (3)
    • ►  March (2)
    • ►  February (1)
    • ►  January (3)
  • ►  2010 (9)
    • ►  December (4)
    • ►  October (1)
    • ►  June (1)
    • ►  May (1)
    • ►  January (2)
  • ►  2009 (1)
    • ►  December (1)
Powered by Blogger.

About Me

Unknown
View my complete profile