Educational Codeforces Round 27 E. Fire in the City(二维离散化)
来源:互联网 发布:阿里云美国服务器翻墙 编辑:程序博客网 时间:2024/06/05 18:43
The capital of Berland looks like a rectangle of size n × m of the square blocks of same size.
Fire!
It is known that k + 1 blocks got caught on fire (k + 1 ≤ n·m). Those blocks are centers of ignition. Moreover positions ofk of these centers are known and one of these stays unknown. Allk + 1 positions are distinct.
The fire goes the following way: during the zero minute of fire only these k + 1 centers of ignition are burning. Every next minute the fire goes to all neighbouring blocks to the one which is burning. You can consider blocks to burn for so long that this time exceeds the time taken in the problem. The neighbouring blocks are those that touch the current block by a side or by a corner.
Berland Fire Deparment wants to estimate the minimal time it takes the fire to lighten up the whole city. Remember that the positions ofk blocks (centers of ignition) are known and (k + 1)-th can be positioned in any other block.
Help Berland Fire Department to estimate the minimal time it takes the fire to lighten up the whole city.
The first line contains three integers n,m and k (1 ≤ n, m ≤ 109,1 ≤ k ≤ 500).
Each of the next k lines contain two integersxi andyi (1 ≤ xi ≤ n,1 ≤ yi ≤ m) — coordinates of thei-th center of ignition. It is guaranteed that the locations of all centers of ignition are distinct.
Print the minimal time it takes the fire to lighten up the whole city (in minutes).
7 7 31 22 15 5
3
10 5 13 3
2分析;500个点,直接二分燃烧时间,每次暴力floodfill一下前缀和,然后再暴力扫一遍整个图找到横向的最远未燃烧块的距离和纵向的取最大值,如果最大值小于当前二分出的时间则说明我们可以通过再加一个燃烧块把这片区域覆盖住,总复杂度log*(500*2)^2
- Educational Codeforces Round 27 E. Fire in the City(二维离散化)
- E. Fire in the City Educational Codeforces Round 27 二分+扫描线求面积覆盖+离散化 丧心病狂
- Codeforces 845E Fire in the City
- Codeforces 612D Educational Codeforces Round 4 D. The Union of k-Segments 离散化+map
- Educational Codeforces Round 32:E. Maximum Subsequence(Meet-in-the-middle)
- 【Codeforces845E】Fire in the City
- Educational Codeforces Round 7 E. Ants in Leaves(贪心)
- Educational Codeforces Round 8 E. Zbazi in Zeydabad(BIT)
- Educational Codeforces Round 9 E.Thief in a Shop
- Educational Codeforces Round 8 E - Zbazi in Zeydabad
- Educational Codeforces Round 7-E. Ants in Leaves
- Educational Codeforces Round 9 E. Thief in a Shop
- Educational Codeforces Round 29 E. Turn Off The TV
- Educational Codeforces Round 21E
- Educational Codeforces Round 26 E
- Educational Codeforces Round 903E
- Codeforces Round #436 E. Fire
- Educational Codeforces Round 10D 离散化+树状数组
- Jquery_选择器
- 进程管理知识整理
- AI ‘小白’说一下
- Python爬虫数据写入操作
- 大数据学习前夕[03]:Maven安装
- Educational Codeforces Round 27 E. Fire in the City(二维离散化)
- block,inline和inline-block
- Linux常用SVN 操作
- DrawLayout
- 华为--嵌入式软件工程师面试题汇总
- 学习记录3(17/09/16于成都)
- 判断字符串是JSONObject还是JSONArray
- 程序片段----使用Windows api 获得系统时间并生成文件夹
- POJ 2481 Cows(树状数组)