QOJ.ac

QOJ

実行時間制限: 1 s メモリ制限: 256 MB 満点: 100

#2052. 陨石坑

統計

月球上的陨石坑可以表示为平面上 $N$ 个随机选择的整点。

你控制着一辆漫游车;漫游车准备在三个陨石坑中放置传感器。

为了有效地完成任务,你必须找出以陨石坑点为顶点且面积最大的三角形。

输入格式

输入的第一行包含一个整数 $N$ —— 点的数量 ($3 \le N \le 2 \times 10^5$)。

接下来的 $N$ 行,每行包含两个整数 —— 下一个点的坐标 $x_i$ 和 $y_i$。

保证每个数字 $x_i$ 和 $y_i$ 都是从 $-N$ 到 $N$ 之间的 $2N + 1$ 个整数中等概率选取的。

输出格式

输出三行,每行包含三角形的一个顶点的坐标。如果存在多个解,输出其中任意一个即可。

样例

输入 1

5
1 5
-2 5
-1 2
4 -3
5 3

输出 1

4 -3
5 3
-2 5

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.