Since the beginning of a quarter of an hour late for dinner, and then open the game. A list glanced at the title has passed two dozen teams, and BoA to do A.
Chuan said the division title last question look like the shortest, so I went to see M, and finished after BoA also stay with me. Maximum value that is the minimum distance of the same Frogger POJ, S to T path evaluation when M is a beginning to see. Later found on the number of edges in the path traversed is limited. So I think, then think of the original record to this point of the shortest distance Dis [] into recording arrived at this point of the lowest level required for aircraft Dis_Level of [], so the rest is a common Dijkstra. After doing M game was about a half hour.
Prior to this, pass division and BoA were opened L and C, after I finished listening to C is a computational geometry, I wanted to see, but BoA said to do it themselves, so they pass and see the teacher L. L problem is to find the law, but suffer no place to start, and later spread to knock analog division, said the play table, in line with the findings of the odd arithmetic progression, and the even result in a multiple of 4 are all equal to 4, the rest of the results are even equal to itself.
After finished four questions from the end of the game and there are about a half an hour, people on the list D had a lot of questions, so they go to D title. I began to feel a disjoint-set + is greedy, but not the result. Unfortunately, the end did not do it.