#PU617. USACO 2016 February Contest, Bronze — Problem 3. Load Balancing
USACO 2016 February Contest, Bronze — Problem 3. Load Balancing
USACO 2016 February Contest, Bronze — Problem 3. Load Balancing
题目描述
Farmer John's cows are each standing at distinct locations on his two-dimensional farm (, and the 's and 's are positive odd integers of size at most ). FJ wants to partition his field by building a long (effectively infinite-length) north-south fence with equation ( will be an even integer, thus ensuring that he does not build the fence through the position of any cow). He also wants to build a long (effectively infinite-length) east-west fence with equation , where is an even integer. These two fences cross at the point , and together they partition his field into four regions. FJ wants to choose and so that the cows appearing in the four resulting regions are reasonably "balanced", with no region containing too many cows. Letting be the maximum number of cows appearing in one of the four regions, FJ wants to make as small as possible. Please help him determine this smallest possible value for . For the first five test cases, is guaranteed to be at most 100. In all test cases, is guaranteed to be at most 1,000,000.
输入格式
The first line of the input contains two integers, and . The next lines each contain the location of a single cow, specifying its and coordinates.
输出格式
You should output the smallest possible value of that FJ can achieve by positioning his fences optimally.
数据范围
(见题面原文)
样例
样例 1
7 10
7 3
5 5
9 7
3 1
7 7
5 3
9 1
2
Problem credits: Brian Dean