Petr's blog

By Petr, history, 9 months ago, In English
 
 
 
 
  • Vote: I like it
  • +73
  • Vote: I do not like it

»
9 months ago, # |
Rev. 2   Vote: I like it +14 Vote: I do not like it

My solution seemed to be a little bit too slow, so I’ve tried to squeeze it. Bitsets were used only to store the matrix, so I’ve tried to check if asking about an edge will be faster on normal array. Finally, the only differences between the first and the last submission are some optimizations in the top of the code. I didn’t care about incorrect attempts, as the wouldn’t change my position.

My debug does nothing without an exact compilation flag. You might remember it from a puzzle for viewers from the last ICPC finals.

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

    Thanks, that explains everything! And I guess you were submitting to the actual contest instead of using the "run" function to compare the time spent on pretests between different solutions?

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

      Yep, exactly. I knew that my penalty wasn't great so I just wanted to make sure that E passes.

»
9 months ago, # |
  Vote: I like it +5 Vote: I do not like it

orz gennady