CF97B Superset 题解 分治

Superset

传送门

A set of points on a plane is called good, if for any two points at least one of the three conditions is true:

• those two points lie on same horizontal line;
• those two points lie on same vertical line;
• the rectangle, with corners in these two points, contains inside or on its borders at least one point of the set, other than these two. We mean here a rectangle with sides parallel to coordinates’ axes, the so-called bounding box of the two points.

You are given a set consisting of $n$ points on a plane. Find any good superset of the given set whose size would not exceed $2\cdot 10^5$ points.

Input

The first line contains an integer $n$ ( $1<=n<=10^4$ ) — the number of points in the initial set. Next $n$ lines describe the set’s points. Each line contains two integers $x_i$ and $y_i$ ( $-10^9<=x_i,y_i<=10^9$ ) — a corresponding point’s coordinates. It is guaranteed that all the points are different.

Output

Print on the first line the number of points $m$ ( $n<=m<=2\cdot 10^5$ ) in a good superset, print on next $m$ lines the points. The absolute value of the points’ coordinates should not exceed $10^9$ . Note that you should not minimize $m$ , it is enough to find any good superset of the given set, whose size does not exceed $2\cdot 10^5$ .

All points in the superset should have integer coordinates.

Example

input

2
1 1
2 2

output

3
1 1
2 2
1 2

题目翻译

如果对于任意两个点，三个条件中至少有一个为真，则平面上的一组点称为好点：

• 这两点位于同一条水平线上；
• 这两点位于同一条垂直线上；
• 以这两点为角的矩形在其内部或边界上至少包含集合中除这两点以外的一个点。这里我们指的是边与坐标轴平行的矩形，即所谓的两点的边界框。请找出所给集合中大小不超过 $2\cdot 10^5$ 个点的任何好的超集。

输入格式

第一行包含一个整数 $n(1\le n\le 10^4)$-初始集合中的点数。接下来的 n 行描述集合中的点。每行包含两个整数 $x_i,y_i(-10^9\le x_i,y_i\le 10^9)$–对应点的坐标。保证所有点都是不同的。

输出格式

在第一行打印好超集中的点数 $m(n\le m\le 2\cdot 10^5)$，在接下来的 $m$ 行打印点数。点坐标的绝对值不应超过 $10^9$。注意不要最小化 $m$，只要找到给定集合中任何一个大小不超过 $2\cdot 10^5$ 的良好超集即可。
超集中所有点的坐标都应为整数。

$以上来自CodeForces，翻译：DeepL$

解题思路

先将每个点按照 $x$ 坐标为第一关键字，$y$ 坐标为第二关键字从小到大进行排序。

然后进行分治。对于一个区间 $[l,r]$，以中间点 $mid$ 的 $x$ 坐标为新增的点的 $x$ 坐标，$[l,r]$ 内每个点的 $y$ 坐标为新增的点的 $y$ 坐标，共构造出 $r-l+1$ 个点。

最后将原来的点和新增的点一起进行排序，去重即可。

AC Code

#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2e5 + 5;
struct Point {
	int x, y;
	bool operator<(Point b) {
		if (x != b.x) {
			return x < b.x;
		}
		return y < b.y;
	}
	bool operator==(Point b) {
		return x == b.x && y == b.y;
	}
};
int n;
Point a[Maxn];
int len;
int Final_len;
inline void partition(int l, int r) {
	if (l == r) {
		return;
	}
	int mid = (l + r) >> 1;
	for (int i = l; i <= r; i++) {
		a[++len] = (Point) {
			a[mid].x, a[i].y
		};
	}
	partition(l, mid);
	partition(mid + 1, r);
}
inline void work() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].x >> a[i].y;
	}
	sort(a + 1, a + n + 1);
	len = n;
	partition(1, len);
	sort(a + 1, a + len + 1);
	Final_len = unique(a + 1, a + len + 1) - a - 1;
	cout << Final_len << endl;
	for (int i = 1; i <= Final_len; i++) {
		cout << a[i].x << " " << a[i].y << endl;
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	work();
	return 0;
}//C++20