F - Friends and Berries

F - Friends and Berries

  URAL - 2067 

There is a group of  n children. According to a proverb, every man to his own taste. So the children value strawberries and raspberries differently. Let’s say that  i-th child rates his attachment to strawberry as  s  _i and his attachment to raspberry as  r _i.

According to another proverb, opposites attract. Surprisingly, those children become friends whose tastes differ.

Let’s define friendliness between two children  v,  u as:  p(  v,  u) =  sqrt((  s  _v −  s _u)  ² + (  r  _v −  r  _u)  ²)

The friendliness between three children  v,  u,  w is the half the sum of pairwise friendlinesses:  p(  v,  u,  w) = (  p(  v,  u) +  p(  v,  w) +  p(  u,  w)) / 2

The best friends are that pair of children  v,  u for which  v ≠  u and  p(  v,  u) ≥  p( v,  u,  w) for every child  w. Your goal is to find all pairs of the best friends.

Input

In the first line there is one integer  n — the amount of children (2 ≤  n ≤ 2 · 10  ⁵).

In the next  n lines there are two integers in each line —  s  _i and  r  _i (−10  ⁸ ≤  s _i,  r  _i ≤ 10  ⁸).

It is guaranteed that for every two children their tastes differ. In other words, if v ≠  u then  s  _v ≠  s  _u or  r  _v ≠  r  _u.

Output

Output the number of pairs of best friends in the first line.

Then output those pairs. Each pair should be printed on a separate line. One pair is two numbers — the indices of children in this pair. Children are numbered in the order of input starting from 1. You can output pairs in any order. You can output indices of the pair in any order.

It is guaranteed that the amount of pairs doesn’t exceed 10  ⁵.

Example

input	output
2 2 3 7 6	1 1 2
3 5 5 2 -4 -4 2	0

思路：

求所有点在一条直线上。

因为p(v,u)>(  p(v,u)+p(v,w)+p(u,w)  )/2 —> p(v,u)>p(v,w)+p(u,w)

把他们看成三个点，w只有在vw线段上才能满足条件。而w必须取任意值都行才可以，所以所有点在一条线段上。

代码：

#include<iostream>
#include<algorithm>
using namespace std;

struct node
{
    int x;
    int y;
    int id;
}s[200010];

int cmp(node a,node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}

int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>s[i].x>>s[i].y;
        s[i].id=i+1;
    }
    sort(s,s+n,cmp);
    int flag=0;
    for(int i=1;i<=n-2;i++)
    {
        if((s[i].x-s[0].x)*(s[n-1].y-s[i].y)!=(s[i].y-s[0].y)*(s[n-1].x-s[i].x))
        {
            flag=1;
            break;
        }
    }
    if(flag==0)
    {
        cout<<"1"<<endl;
        cout<<s[0].id<<" "<<s[n-1].id<<endl;
    }
    else
        cout<<"0"<<endl;
    return 0;
}