This is my own summary of the contest, mainly to give myself advice on how to make me faster on the next contest.
1. Bad horse.
Situation: This is a simple graph traversal problem. I used 34 mins to complete it.
Advice: prepare a dfs and bfs graph traversal template in case of use. Next time you just need to get the input, convert it to the internal format and run the algorithm, which is much faster.
To be more general, you have to make every algorithm at easy access. So next time you got a similar problem, you got time saved.
2. Captain Hammer
This problem I used 20 mins, I think most of my time is spent reading the question. And I find that some part of the problem is not relevant.
Advice 1: Skim reading some part of the problem description that's not relevant.
Note: You have to be sure what you skip is relevant.
Goal: get the essential underlying model both quickly and accurate.
Advice 2: Be careful with mixture of Double and Int
Why: Different sequences of double operation of the same essential effect could generate different result.
One simple trick: cast doubles with few fraction digits to integers and then scale back the result.
3. Moist.
Again, I used 20 mins. I made a mistake that i thought the key process of insertion sort to be a bubble sort at first. Did the first version, submit the answer and get a incorrect sign. Then I quickly found the key model part and get what's going on.
Advice: Once you have a model in your mind, you must know what parts of the description correspond your model. So reread the description carefully and make sure that it is.