Codeforces 651 C Watchmen【思维】

C. Watchmen

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (x_i, y_i).

They need to arrange a plan, but there are some difficulties on their way. As you know, Doctor Manhattan considers the distance between watchmen i and j to be |x_i - x_j| + |y_i - y_j|. Daniel, as an ordinary person, calculates the distance using the formula .

The success of the operation relies on the number of pairs (i, j) (1 ≤ i < j ≤ n), such that the distance between watchman i and watchmen j calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs.

Input

The first line of the input contains the single integer n (1 ≤ n ≤ 200 000) — the number of watchmen.

Each of the following n lines contains two integers x_i and y_i (|x_i|, |y_i| ≤ 10⁹).

Some positions may coincide.

Output

Print the number of pairs of watchmen such that the distance between them calculated by Doctor Manhattan is equal to the distance calculated by Daniel.

Examples

Input

3
1 1
7 5
1 5

Output

2

Input

6
0 0
0 1
0 2
-1 1
0 1
1 1

Output

11

Note

In the first sample, the distance between watchman 1 and watchman 2 is equal to |1 - 7| + |1 - 5| = 10 for Doctor Manhattan and for Daniel. For pairs (1, 1), (1, 5) and (7, 5), (1, 5) Doctor Manhattan and Daniel will calculate the same distances.

题目大意：

给你n个点，接下来n行每行两个元素表示点的坐标。让你找一共有多少对点能够满足其两点间的曼哈顿距离==两点间距离（根号下那个）；

思路：

1、不难理解，当两点间距离是直线的时候，其曼哈顿距离==两点间距离。

2、那么我们将其按照x排序，看看有多少点对的x相同，再按照y排序，看看有多少点对y相同。累加起来。

3、那么如果两个点x也相同，y也相同的情况，我们按照x排序之后加上了一次，按照y排序之后又加上了一次一共两次，所以我们还要将这样的重复点去掉即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll __int64
struct node
{
    int x,y;
}a[200040];
int n;
int cmp(node a,node b)
{
    if(a.x!=b.x)
    return a.x<b.x;
    else return a.y<b.y;
}
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&a[i].x,&a[i].y);
        }
        ll output=0;
        sort(a,a+n,cmp);
        int tmp=0;
        ll cont=0;
        for(int i=0;i<n;i++)
        {
            if(i==0)
            {
                cont=1;
                tmp=a[i].x;
            }
            else
            {
                if(tmp==a[i].x)cont++;
                else
                {
                    tmp=a[i].x;
                    output+=(cont)*(cont-1)/2;
                    cont=1;
                }
            }
            swap(a[i].x,a[i].y);
        }
        output+=(cont)*(cont-1)/2;
        sort(a,a+n,cmp);
        tmp=0;
        cont=0;
        for(int i=0;i<n;i++)
        {
            if(i==0)
            {
                cont=1;
                tmp=a[i].x;
            }
            else
            {
                if(tmp==a[i].x)cont++;
                else
                {
                    tmp=a[i].x;
                    output+=(cont)*(cont-1)/2;
                    cont=1;
                }
            }
            swap(a[i].x,a[i].y);
        }
        output+=(cont)*(cont-1)/2;
        sort(a,a+n,cmp);
        int tmpx=a[0].x,tmpy=a[0].y;
        ll contz=0;
        for(int i=1;i<n;i++)
        {
            if(tmpx==a[i].x&&tmpy==a[i].y)contz++;
            else
            {

                tmpx=a[i].x;
                tmpy=a[i].y;
                output-=(contz+1)*(contz)/2;
                contz=0;
            }
        }
        output-=(contz+1)*(contz)/2;
        printf("%I64d\n",output);
    }
}