Very unfortunate game, missed the silver medal with a time penalty of more than 60 minutes. This year six ICPC network game which is playing the worst Nam Cheong Station, somewhere God's own right, was finally arranged to Nanchang.
Opening teammates called to look at the L, said football, found that a simple simulation, directly on the machine to write, time to pay the next memories do not feel right. According to my reading comprehension questions meaning of the questions are the same points, compare the number of goals, but the actual rules of football is more goal difference, then go back and read under the meaning of the questions, find the meaning of the word is seemingly goal difference, I read wrong, then quickly change to pay the complete code, although since confirmed that Italy spend some time, but fortunately did not have 20 minutes penalty. Question C formula then zz say the launch is binomial theorem, let zz play C. Then I said between lhy and E questions meaning of the questions, then I feel maximum spanning tree, then the rest of the right side of the biggest plus to like, and more convinced that Dui, zz playing very fast, it took 15 minutes C questions AC. Then discuss the next play to make lhy E, because I was not familiar with graph theory. The results lhy fight back E wa the questions submitted, printed under the code, find disjoint-set path optimization is not added, but this is not a reason to consider that wa can only lead to TLE, and then look down, and he also found lhy code implementation logic error, then changed again and a a cross. Let lhy back print under the title Code E to find their own mistakes, and I go to prove the correctness of the spanning tree algorithm E biggest problem, it took about 10 minutes required to prove that maximum spanning tree algorithm is correct. zz told me G title meaning of the questions, but to understand the meaning of problems zz wrong, I think a mistake-half plus preprocessing algorithm error, zz find themselves misunderstood the meaning of problems and then after the wa. Then I am ready to take questions directly E, halfway through lhy judge did not find a spanning tree case, the code changed, and finally to the AC E title. Then I looked again at the correct understanding of the meaning of problems G title, found that G is not a constant problem of scale, to play table on the computer and found i> 2803 when, fac [i]% mod = 0, then came up with positive solutions, preprocessing after sorting, binary search can answer, write to the last two lines find themselves vector of lowerbound not use (it seems a bit stupid, stl not cooked), let teammates to help write a lowerbound, four of the five elements, it took more than 30 minutes G title to AC, then 3 hours and 20 minutes. When I want to play G title to teammate B title, so after G to B and that the meaning of the questions tell me, n <
Overall, his play on the game is quite satisfactory, L title may play a bit slow, but the scene that question a lot of teams understand a little mistake, this question a little small sign cancer. E title card bit long, look at the code looked nearly over 20 minutes, spanning tree can not be the case did not see his teammates leak judgment, and spend a little long, B title back to pan, first put the wrong title to lead the network flow direction, the minimum cost flow then copied the wrong board, has been adjusted only 10 minutes, no one expected a dp, and thus missed the opportunity 5 questions with silver.