2595. Defend the Bases

单点时限: 5.0 sec

内存限制: 256 MB

A country Gizevom is being under a sneak and fierce attack by their foe. They have to deploy one or more troops to every base immediately in order to defend their country. Otherwise their foe would take all the bases and declare “All your base are belong to us.”

You are asked to write a program that calculates the minimum time required for deployment, given the present positions and marching speeds of troops and the positions of the bases.

输入格式

The input is given in the following format:

N M

x1 y1 v1

x2 y2 v2

. . .

xN yN vN

x1 y1

x2 y2

. . .

xM yM

N is the number of troops (1 ≤ N ≤ 100); M is the number of bases (1 ≤ M ≤ 100); (xi, yi) denotes the present position of i-th troop; vi is the speed of the i-th troop (1 ≤ vi ≤ 100); (xj, yj) is the position of the j-th base.All the coordinates are integers between 0 and 10000 inclusive.

输出格式

Print the minimum required time with an absolute error of at most 10-8 in a line.

样例

Input
2 2
10 20 1
0 10 1
0 10
10 0
Output
14.14213562

8 人解决,19 人已尝试。

9 份提交通过,共有 100 份提交。

7.7 EMB 奖励。

创建: 10 年,8 月前.

修改: 3 年前.

最后提交: 1 月,3 周前.

来源: Japan

题目标签