Eh eh this time bomb
I'm good food ah 233
The T1 is mainly just want to start trouble, then I hit a very uncomfortable after 2h, but this thing has also been shot dead on, autistic ing
Opened T2, thought of a property because the brain is not yet clear thought through, lost $ 60pts $
T3 is not yet full output points -1
Total $ 100 + 40 + 0 = 140pts $, $ rank17 $ progress seems to have (not)
Continue efforts to learn the lesson ah
$ T1：kill $
Half + greedy, greedy do not know the validity of
$ T2：beauty $
Paired observation point and the point is, we can find a nature: all routes must have a common point of intersection (not necessarily common edge)
For the common point of intersection can get the answer that all special point to his distance
And if a point of intersection of his answers do not necessarily greater than the correct answer, do all of the intersection point answer must be equal
Taking all points like min
$ T3：weight $
(I always feel seen this question, but now could not find)
First find out a minimum spanning tree, each side of the tree and the discussion of non-tree edges
For non-tree edge, his answer is the maximum value of -1 in the chain two points in the configuration corresponding to the minimum spanning tree his
For the side of the tree, his answer is that all paths through the weight of his non-tree edge minimum -1
Cross or tree maintenance can lct