hdu 3622 Bomb Game (2-SAT)

最新推荐文章于 2019-10-30 15:26:06 发布

XTU_wcb

最新推荐文章于 2019-10-30 15:26:06 发布

阅读量250

点赞数

分类专栏： 2-SAT

本文链接：https://blog.csdn.net/u013023344/article/details/39256101

版权

该博客介绍了如何解决一个计算机游戏的策略问题，玩家需要在给定的点对中放置不相交的圆，目标是最小化所有圆的半径并求得最大得分。博主提出了使用二分搜索结合2-SAT算法来判断半径是否可行，通过实例解释了算法的实现过程。

摘要由CSDN通过智能技术生成

Problem Description

Robbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each round, the computer will give Robbie two places, and Robbie should choose one of them to put a bomb. The explosion area of the bomb is a circle whose center is just the chosen place. Robbie can control the power of the bomb, that is, he can control the radius of each circle. A strange requirement is that there should be no common area for any two circles. The final score is the minimum radius of all the N circles.
Robbie has cracked the game, and he has known all the candidate places of each round before the game starts. Now he wants to know the maximum score he can get with the optimal strategy.

Input