306916: CF1270E. Divide Points
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Divide Points
题意翻译
给你n个点和它们的坐标,现在给它们两两连上边,如果在同一组为黄色,不同组为蓝色。现在让你给出任意一种分组方案,使得所有长度相同的边颜色相同。题目描述
You are given a set of $ n\ge 2 $ pairwise different points with integer coordinates. Your task is to partition these points into two nonempty groups $ A $ and $ B $ , such that the following condition holds: For every two points $ P $ and $ Q $ , write the [Euclidean distance](https://en.wikipedia.org/wiki/Euclidean_distance) between them on the blackboard: if they belong to the same group — with a yellow pen, and if they belong to different groups — with a blue pen. Then no yellow number is equal to any blue number. It is guaranteed that such a partition exists for any possible input. If there exist multiple partitions, you are allowed to output any of them.输入输出格式
输入格式
The first line contains one integer $ n $ $ (2 \le n \le 10^3) $ — the number of points. The $ i $ -th of the next $ n $ lines contains two integers $ x_i $ and $ y_i $ ( $ -10^6 \le x_i, y_i \le 10^6 $ ) — the coordinates of the $ i $ -th point. It is guaranteed that all $ n $ points are pairwise different.
输出格式
In the first line, output $ a $ ( $ 1 \le a \le n-1 $ ) — the number of points in a group $ A $ . In the second line, output $ a $ integers — the indexes of points that you include into group $ A $ . If there are multiple answers, print any.
输入输出样例
输入样例 #1
3
0 0
0 1
1 0
输出样例 #1
1
1
输入样例 #2
4
0 1
0 -1
1 0
-1 0
输出样例 #2
2
1 2
输入样例 #3
3
-2 1
1 1
-1 0
输出样例 #3
1
2
输入样例 #4
6
2 5
0 3
-4 -1
-5 -4
1 0
3 -1
输出样例 #4
1
6
输入样例 #5
2
-1000000 -1000000
1000000 1000000
输出样例 #5
1
1