D. Limak and Shooting Points 计算几何+模拟

Fop_zz

于 2017-10-08 22:32:17 发布

阅读量673

点赞数 1

CC 4.0 BY-SA版权

分类专栏： bzoj 计算几何

本文链接：https://blog.youkuaiyun.com/Fop_zz/article/details/78178164

在熊之地，Limak使用k个魔法传送石与n个怪物作战。每块石头能让他传送到特定位置并射出一支箭，击中第一条直线上的怪物。题目要求计算出有多少怪物可能被击中。输入包含传送石和怪物的位置，输出是可能被击中的怪物数量。通过预处理线段间怪物信息，并考虑所有射击顺序，可以优化解题策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation stones. Each stone can be used at most once. The i-th stone allows to teleport to a point (axi, ayi). Limak can use stones in any order.

There are n monsters in Bearland. The i-th of them stands at (mxi, myi).

The given k + n points are pairwise distinct.

After each teleportation, Limak can shoot an arrow in some direction. An arrow will hit the first monster in the chosen direction. Then, both an arrow and a monster disappear. It’s dangerous to stay in one place for long, so Limak can shoot only one