QOJ.ac

QOJ

Límite de tiempo: 1.0 s Límite de memoria: 256 MB Puntuación total: 100 Hackeable ✓

#7730. 凸包检测器

Estadísticas

给定一个多边形,判断它是否为凸多边形。

凸多边形是一个简单多边形(即:没有两个顶点重合,且没有两条边相交,除非两条相邻的边在顶点处相交),且所有内角都严格小于 $\pi$。

输入格式

第一行包含一个整数 $n$ ($3 \le n \le 2 \times 10^5$),表示多边形的顶点数。

接下来的 $n$ 行,每行包含两个整数 $(x_i, y_i)$,表示多边形的顶点。保证 $|x_i|, |y_i| \le 10^9$。

多边形由连接 $(x_i, y_i)$ 和 $(x_{i \pmod n + 1}, y_{i \pmod n + 1})$ 的边组成,其中 $1 \le i \le n$。

输出格式

输出一个字符串,“Yes” 或 “No”,表示它是否为凸多边形。

样例

样例输入 1

3
0 0
1 0
0 1

样例输出 1

Yes

样例输入 2

4
0 0
0 1
1 1
1 0

样例输出 2

Yes

样例输入 3

4
0 0
0 3
1 2
1 1

样例输出 3

Yes

样例输入 4

3
0 0
0 0
0 0

样例输出 4

No

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.