One Point Solution

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

Saturday, 11 May 2013

TCO 2013 round 2C: bummer (And editorial for 250)

Posted on 18:41 by Unknown

For some minutes I felt like I actually solved the hard problem during a match. It was short-lived, because I quickly figured there was no way it was correct.

250


Link to problem statement.

I opened this problem. Somehow I figured up quickly that everything depended on the distance between the Foxes. But I spent time trying to prove myself of it. I coded a solution that seemed correct and passed examples (Recursive logic that divided by 2), was about to submit it and I figured that there was something wrong with it - You can't introduce the same Fox to multiple people during a song -. I predicted that this was going to be a juicy challenge case. I fixed it up, but it was very late. I could only score 170-ish points. I was not going to advance with just that.

The editorial for this problem is finished. You can read an explanation there. I am trying a new approach and it is to develop a problem's editorial as soon as I understand the problem. Instead of waiting to solve the other problems... This should make editorials faster. I think.

500

Link to problem statement.

For some reason I missed the "simple" dynamic programing solution. This problem seemed harder than it was, so I decided to open the 1000.

1000

Link to problem statement.

I actually thought I could solve this thing. I thought of something involving ternary search.

I think the top-level logic is sort-of correct (and I actually survived two challenge cases), but I took too many shortcuts. Returning 0 when the increment is too big is for example not really valid, because it could be possible to try to be lucky and still get more than A-1 moves. I figured out this mistake after submitting, there were 10 minutes left. I should have spent these minutes generating a test case with a distance of 49 for the foxes in 250, but I still wasted them trying to come up with a correct solution.

Challenge phase

I tried to generate a test case with 49 distance between foxes during intermission, but I was taking too long to do the ascii art. I should have made a python script to generate it for me. By the time I finished making the test case, the solutions in my room using division by 2 were all challenged.

I doubt I could have scored the 300 challenge points necessary to allow me to advance anyway. Although I could have possibly earned a t-shirt. I think though that I am going to win a TCO 13 t-shirt from the Marathon round I am participating at. So it probably does not matter.

I guess it is another year in which I do not get even close to advancing to the algorithm finals. Bummer.

Opinions, etc

It was a good problem set. I just need to improve.

Email ThisBlogThis!Share to XShare to Facebook
Posted in editorial, recap, tco, tco12, tco2012, tco2013 | 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)
      • Script to recover the old gmail favicon
      • SRM 580 Editorial now published
      • SRM 580 recap and WallGameDiv1 editorial preview
      • SRM 580, WallGameDiv2, editorial preview
      • SRM 579 Editorial preview: TravellingPurchasingMan...
      • SRM 579 Editorial preview: RockPaperScissors
      • Life with chronic headache
      • SRM 579 - Disaster averted?
      • Editorial for TCO round 2C hard: WellTimedSearch
      • TCO 2013 round 2C: bummer (And editorial for 250)
      • Regarding the smug opposition to programming contests
      • Editorial for SRM 577 div1 hard: BoardPainting
      • SRM 577 Editorial for div1 medium: EllysChessBoard
    • ►  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)
    • ►  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