Codeforces 650A Watchmen(数学，算法优化)

A. 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 (xi, yi).

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 |xi - xj| + |yi - yj|. 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 xi and yi (|xi|, |yi| ≤ 109).

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个点的坐标(xi,yi)；问有多少对点|xi-xj|+|yi-yj| == sqrt( (xi-xj)^2 + (yi-yj)^2 )。 注意：题中有些点的和重合的。

题解： 首先我们要知道当两点的横纵坐标至少有一个相等时，才会满足|xi-xj|+|yi-yj| == sqrt( (xi-xj)^2 + (yi-yj)^2 ) 

光知道这个还是不行。这一题的考点在算法优化，用两重for循环的O(n^2)算法会超时。 我们可以将坐标点按照x，y分别排序，然后统计横坐标或者纵坐标都为num的有多少个，假设是cnt个，那么共有cnt*(cnt-1)/2对。 由于有一些重合点，在我们分别统计横坐标和纵坐标时，会将这一部分算重。 我们还需要统计坐标重合点，最后减去这部分的对数。

这个算法的时间复杂度为O(n*logn)。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 200010
#define LL long long 
struct node
{
	int x,y;
}a[maxn];

int cmpx(node u,node v)
{
	if(u.x==v.x)
		return u.y<v.y;
	return u.x<v.x;
}

int cmpy(node u,node v)
{
	if(u.y==v.y)
		return u.x<v.x;
	return u.y<v.y;
}

LL C(int n)
{
	if(n<2)
		return 0;
	else
	{
		LL x=1;
		int i;
		for(i=1;i<=2;++i)
			x=x*(n-i+1)/i;
		return x;
	}
}


int main()
{
	int n,i,j;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;++i)
			scanf("%d%d",&a[i].x,&a[i].y);
		sort(a,a+n,cmpx);
		LL ans=0;
		int t=0,cnt=1;
		for(i=1;i<n;++i)
		{
			if(a[i].x==a[t].x)
				cnt++;
			else
			{
				ans+=C(cnt);
				cnt=1;
				t=i;
			}
		}
		ans+=C(cnt);
		sort(a,a+n,cmpy);
		int num=1;
		t=0;  cnt=1;
		for(i=1;i<n;++i)
		{
			if(a[i].y==a[i-1].y&&a[i].x==a[i-1].x)
				num++;
			else
			{
				ans-=C(num);
				num=1;
			}
				
			if(a[i].y==a[t].y)
				cnt++;
			else
			{
				ans+=C(cnt);
				cnt=1;
				t=i;
			}
		}
		ans+=C(cnt);
		ans-=C(num);
		printf("%I64d\n",ans);
	}
}