2019ICPC Nanjing Network Game summary

This time in the school play, and overall not good, over two title rows of more than 200 school .. miserable.
Opening a period of time no one had questions, but a lot of people pay I, I look at it, looking at found not to do, this time turn F, it took a long time to read the meaning of the questions to find time to think of the Chairman of the tree, but the President of this tree to find the first time to write, write very slowly, and pay up Tle written after the same time it is also fast two hours teammates say H writable. flies abound. under discussion is the two shortest.
ran SPFA, T .. this time I'm not sure SPFA. Figure it and pushed aside, and then change the code found to be clear of the vector problem .. because this figure is zero .. usually are after the start .. 1 H began after a nightmare F's. array of big open later the situation got PE, has changed a bit RE .. because they do not know the count of garlic off topic sentence. just kept on going to pay a lot of hair RE. Finally he found he found the discovery node tree labeled chairman forget to reset the stupid mistake ... really changed a bit .. pass by .. last time is not much left of it .A question thought about 000.
after the game is set to maintain F-half looking .. at that time thought about sliding window method, but did not expect half, otherwise it would be better to write set very And more. This bug does not appear.
Hope this will not happen behind several problems.