#PU1067. USACO 2020 December Contest, Gold — Problem 3. Square Pasture
USACO 2020 December Contest, Gold — Problem 3. Square Pasture
USACO 2020 December Contest, Gold — Problem 3. Square Pasture
题目描述
Farmer John's largest pasture can be regarded as a large 2D grid of square "cells" (picture a huge chess board). Currently, there are cows occupying some of these cells (). Farmer John wants to build a fence that will enclose a square region of cells; the square must be oriented so its sides are parallel with the and axes, and it could be as small as a single cell. Please help him count the number of distinct subsets of cows that he can enclose in such a region. Note that the empty subset should be counted as one of these.
输入格式
The first line contains a single integer . Each of the next lines Each of the next lines contains two space-separated integers, indicating the coordinates of a cow's cell. All coordinates are distinct from each-other, and all coordinates are distinct from each-other. All and values lie in the range .
输出格式
The number of subsets of cows that FJ can fence off. It can be shown that this quantity fits within a signed 32-bit integer.
数据范围
In test cases 1-5, all coordinates of cells containing cows are less than . In test cases 6-10, . In test cases 11-20, there are no additional constraints. Problem credits: Benjamin Qi
样例
样例 1
4
0 2
2 3
3 1
1 0
14
In this example, there are $2^4$ subsets in total. FJ cannot create a fence enclosing only cows 1
and 3, or only cows 2 and 4, so the answer is $2^4-2=16-2=14$.
样例 2
16
17 4
16 13
0 15
1 19
7 11
3 17
6 16
18 9
15 6
11 7
10 8
2 1
12 0
5 18
14 5
13 2
420
提示
square fenced area might possibly extend into cells with negative coordinates.