CodeForces 650A Watchmen

E - Watchmen

Time Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There aren 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.

Sample Input

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

Hint

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.

题意:两种计算距离的方法，问多少对坐标满足用这两种方法计算的距离相等。

思路：满足横坐标相等或者纵坐标相等即可，但是要注意横纵坐标都相等就重复了。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
struct node
{
	__int64 x;
	__int64 y;
}t[210000];
bool cmp1(node a,node b)
{
	if(a.x==b.x)
	return a.y<b.y;
	return a.x<b.x;
}
bool cmp2(node a,node b)
{
	return a.y<b.y;
}

int main()
{
	int n,i;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		scanf("%I64d%I64d",&t[i].x,&t[i].y);
		__int64 sum=0;
		__int64 flag=1;
		sort(t,t+n,cmp1);
		for(i=1;i<n;i++)
		{
			if(t[i].x==t[i-1].x)
			flag++;
			else
			{
				sum+=flag*(flag-1)/2;
				flag=1;
			}
		}
		sum+=flag*(flag-1)/2;
		__int64 k=1;
		for(i=1;i<n;i++)
		{
			if(t[i].x==t[i-1].x&&t[i].y==t[i-1].y)
			k++;
			else
			{
				sum-=k*(k-1)/2;
				k=1;
			}
		}
		sum-=k*(k-1)/2;
		sort(t,t+n,cmp2);
		__int64 ans=1;
		for(i=1;i<n;i++)
		{
			if(t[i].y==t[i-1].y)
			ans++;
			else
			{
				sum+=ans*(ans-1)/2;
				ans=1;
			}
		}
		sum+=ans*(ans-1)/2;
		printf("%I64d\n",sum);
	}
	return 0;
}