CF704E.Iron Man

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Tony Stark is playing a game with his suits (they have auto-pilot now). He lives in Malibu. Malibu has nn junctions numbered from 11 to nn , connected with n1n-1 roads. One can get from a junction to any other junction using these roads (graph of Malibu forms a tree).

Tony has mm suits. There's a special plan for each suit. The ii -th suit will appear at the moment of time tit_{i} in the junction viv_{i} , and will move to junction uiu_{i} using the shortest path between viv_{i} and uiu_{i} with the speed cic_{i} roads per second (passing a junctions takes no time), and vanishing immediately when arriving at uiu_{i} (if it reaches uiu_{i} in time qq , it's available there at moment qq , but not in further moments). Also, suits move continuously (for example if viuiv_{i}≠u_{i} , at time it's in the middle of a road. Please note that if vi=uiv_{i}=u_{i} it means the suit will be at junction number viv_{i} only at moment tit_{i} and then it vanishes.

An explosion happens if at any moment of time two suits share the same exact location (it may be in a junction or somewhere on a road; while appearing, vanishing or moving).

Your task is to tell Tony the moment of the the first explosion (if there will be any).

输入格式

The first line of the input contains two integers nn and mm ( 1<=n,m<=1000001<=n,m<=100000 ) — the number of junctions and the number of suits respectively.

The next n1n-1 lines contain the roads descriptions. Each line contains two integers aia_{i} and bib_{i} — endpoints of the ii -th road ( 1<=ai,bi<=n1<=a_{i},b_{i}<=n , aibia_{i}≠b_{i} ).

The next mm lines contain the suit descriptions. The ii -th of them contains four integers tit_{i} , cic_{i} , viv_{i} and uiu_{i} ( 0<=ti<=10000,1<=ci<=100000<=t_{i}<=10000,1<=c_{i}<=10000 , 1<=vi,ui<=n1<=v_{i},u_{i}<=n ), meaning the ii -th suit will appear at moment of time tit_{i} at the junction viv_{i} and will move to the junction uiu_{i} with a speed cic_{i} roads per second.

输出格式

If there would be no explosions at all, print -1 in the first and only line of output.

Otherwise print the moment of the first explosion.

Your answer will be considered correct if its relative or absolute error doesn't exceed 10610^{-6} .

输入输出样例

  • 输入#1

    6 4
    2 5
    6 5
    3 6
    4 6
    4 1
    27 6 1 3
    9 5 1 6
    27 4 3 4
    11 29 2 6
    

    输出#1

    27.3
    
  • 输入#2

    6 4
    3 1
    4 5
    6 4
    6 1
    2 6
    16 4 4 5
    13 20 6 2
    3 16 4 5
    28 5 3 5
    

    输出#2

    -1
    
首页