300713: CF135B. Rectangle and Square

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Rectangle and Square

题意翻译

### 题目描述 Kc吟唱着歌谣,躺在草坪上边想着她边看起了星星。Kc刚刚结识了笛卡尔这位好基友,认为他的坐标系非常神奇。于是他随机地选出了8颗星星,并且给它们标上了坐标。Kc又不甘寂寞,于是思考起一个问题:这八个点能否恰好构成一个正方形和一个矩形呢? ### 输入格式 输入文件包括8行16个数,表示8个星星的坐标,坐标绝对值不超过10000。 ### 输出格式 输出文件第一行是"YES"或者"NO"。表示是否有解。 若有解则第二行依次输出正方形每个顶点的序号。第三行依次输出矩形每个顶点的序号。序号即为输入的顺序。 另外注意:因为kc是一个刁端的人,所以他要求第二行和第三行这八个数要字典序最小。 四点共线不能认为是正方形或矩形 ### 输入输出样例 ### 输入 #1 0 0 10 11 10 0 0 11 1 1 2 2 2 1 1 2 ### 输出 #1 YES 5 6 7 8 1 2 3 4 ### 说明/提示: 图形不一定要与坐标轴平行。

题目描述

Little Petya very much likes rectangles and especially squares. Recently he has received 8 points on the plane as a gift from his mother. The points are pairwise distinct. Petya decided to split them into two sets each containing 4 points so that the points from the first set lay at the vertexes of some square and the points from the second set lay at the vertexes of a rectangle. Each point of initial 8 should belong to exactly one set. It is acceptable for a rectangle from the second set was also a square. If there are several partitions, Petya will be satisfied by any of them. Help him find such partition. Note that the rectangle and the square from the partition should have non-zero areas. The sides of the figures do not have to be parallel to the coordinate axes, though it might be the case.

输入输出格式

输入格式


You are given 8 pairs of integers, a pair per line — the coordinates of the points Petya has. The absolute value of all coordinates does not exceed $ 10^{4} $ . It is guaranteed that no two points coincide.

输出格式


Print in the first output line "YES" (without the quotes), if the desired partition exists. In the second line output 4 space-separated numbers — point indexes from the input, which lie at the vertexes of the square. The points are numbered starting from 1. The numbers can be printed in any order. In the third line print the indexes of points lying at the vertexes of a rectangle in the similar format. All printed numbers should be pairwise distinct. If the required partition does not exist, the first line should contain the word "NO" (without the quotes), after which no output is needed.

输入输出样例

输入样例 #1

0 0
10 11
10 0
0 11
1 1
2 2
2 1
1 2

输出样例 #1

YES
5 6 7 8
1 2 3 4

输入样例 #2

0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7

输出样例 #2

NO

输入样例 #3

0 0
4 4
4 0
0 4
1 2
2 3
3 2
2 1

输出样例 #3

YES
1 2 3 4
5 6 7 8

说明

Pay attention to the third example: the figures do not necessarily have to be parallel to the coordinate axes.

Input

题意翻译

### 题目描述 Kc吟唱着歌谣,躺在草坪上边想着她边看起了星星。Kc刚刚结识了笛卡尔这位好基友,认为他的坐标系非常神奇。于是他随机地选出了8颗星星,并且给它们标上了坐标。Kc又不甘寂寞,于是思考起一个问题:这八个点能否恰好构成一个正方形和一个矩形呢? ### 输入格式 输入文件包括8行16个数,表示8个星星的坐标,坐标绝对值不超过10000。 ### 输出格式 输出文件第一行是"YES"或者"NO"。表示是否有解。 若有解则第二行依次输出正方形每个顶点的序号。第三行依次输出矩形每个顶点的序号。序号即为输入的顺序。 另外注意:因为kc是一个刁端的人,所以他要求第二行和第三行这八个数要字典序最小。 四点共线不能认为是正方形或矩形 ### 输入输出样例 ### 输入 #1 0 0 10 11 10 0 0 11 1 1 2 2 2 1 1 2 ### 输出 #1 YES 5 6 7 8 1 2 3 4 ### 说明/提示: 图形不一定要与坐标轴平行。

加入题单

上一题 下一题 算法标签: