当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2536:Gopher II

题目描述
The gopher family, having averted the canine threat, must face a new predator.

The are n gophers and m gopher holes, each at distinct (x, y) coordinates. A hawk arrives and if a gopher does not reach a hole in s seconds it is vulnerable to being eaten. A hole can save at most one gopher. All the gophers run at the same velocity v. The gopher family needs an escape strategy that minimizes the number of vulnerable gophers.
输入解释
The input contains several cases. The first line of each case contains four positive integers less than 100: n, m, s, and v. The next n lines give the coordinates of the gophers; the following m lines give the coordinates of the gopher holes. All distances are in metres; all times are in seconds; all velocities are in metres per second.
输出解释
Output consists of a single line for each case, giving the number of vulnerable gophers.
输入样例
2 2 5 10
1.0 1.0
2.0 2.0
100.0 100.0
20.0 20.0
输出样例
1

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2536

最后修改于 2020-10-29T06:35:12+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 65536