A10368 | Recover Polygon (hard)
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Zombies have found out about the Zombie Contamination level checker and managed to damage it! Now detecting the shape of their main compound will be a real challenge for Heidi. As before, a lair can be represented as a strictly convex polygon on a lattice. Each vertex of the polygon occupies a point on the lattice. However, the damaged Zombie Contamination level checker can only tell, for each cell, whether the level of Zombie Contamination for that cell is in the set ${1,2,3}$ . In other words, Heidi knows all the cells of the lattice for which the Contamination level is not $0$ and not $4$ .
Given this information, Heidi still wants to know the exact shape of the lair to rain destruction on the zombies. Help her!
Given this information, Heidi still wants to know the exact shape of the lair to rain destruction on the zombies. Help her!
输入格式
The input contains multiple test cases.
The first line of each test case contains two space-separated integers $N$ and $M$ , where $N$ is the size of the lattice grid ( $5<=N<=100000$ ) and $M$ is the number of lattice points for which the Zombie Contamination level is 1, 2, or 3 ( $8<=M<=200000$ ).
The second line of each test case contains $M$ pairs of integers $x_{1},y_{1},...,x_{M},y_{M}$ – coordinates of the cells with Zombie Contamination level not equal to 0 nor 4. It is guaranteed that $1<=x_{i},y_{i}<=N$ . All pairs $x_{i},y_{i}$ are different.
Cells are enumerated based on the coordinates of their upper right corner. This means that the bottommost leftmost cell that touches the origin has coordinates $(1,1)$ , and the uppermost leftmost cell is identified as $(1,N)$ .
The last line of the file contains two zeroes. This line should not be treated as a test case. The sum of the $M$ values for all tests in one file will not exceed $200000$ .
The first line of each test case contains two space-separated integers $N$ and $M$ , where $N$ is the size of the lattice grid ( $5<=N<=100000$ ) and $M$ is the number of lattice points for which the Zombie Contamination level is 1, 2, or 3 ( $8<=M<=200000$ ).
The second line of each test case contains $M$ pairs of integers $x_{1},y_{1},...,x_{M},y_{M}$ – coordinates of the cells with Zombie Contamination level not equal to 0 nor 4. It is guaranteed that $1<=x_{i},y_{i}<=N$ . All pairs $x_{i},y_{i}$ are different.
Cells are enumerated based on the coordinates of their upper right corner. This means that the bottommost leftmost cell that touches the origin has coordinates $(1,1)$ , and the uppermost leftmost cell is identified as $(1,N)$ .
The last line of the file contains two zeroes. This line should not be treated as a test case. The sum of the $M$ values for all tests in one file will not exceed $200000$ .
输出格式
For each test case, the following output is expected:
The first line of the output should contain one integer $V$ , the number of vertices of the polygon that is the secret lair. The next $V$ lines each should contain two integers, denoting the vertices of the polygon in the clockwise order, starting from the lexicographically smallest vertex.
The first line of the output should contain one integer $V$ , the number of vertices of the polygon that is the secret lair. The next $V$ lines each should contain two integers, denoting the vertices of the polygon in the clockwise order, starting from the lexicographically smallest vertex.
输入输出样例
输入 #1
8 19 2 3 2 4 2 5 3 3 3 5 4 3 4 5 4 6 5 2 5 3 5 6 6 2 6 3 6 4 6 5 6 6 6 7 7 6 7 7 5 8 2 2 2 3 2 4 3 2 3 4 4 2 4 3 4 4 0 0
输出 #1
4 2 3 2 4 6 6 5 2 4 2 2 2 3 3 3 3 2
It is guaranteed that the solution always exists and is unique. It is guaranteed that in the correct solution the coordinates of the polygon vertices are between $1$ and $N-1$ . A vertex $(x_{1},y_{1})$ is lexicographically smaller than vertex $(x_{2},y_{2})$ if $x_{1}<x_{2}$ or .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted