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 (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 watchmenj calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs.
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.
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.
3 1 1 7 5 1 5
2
6 0 0 0 1 0 2 -1 1 0 1 1 1
11
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<bits/stdc++.h>
using namespace std;
struct Pos
{
int x;
int y;
}pos[200000];
bool cmp1(const Pos &a,const Pos &b)
{
if(a.x==b.x)
return a.y<b.y;
return a.x<b.x;
}
bool cmp2(const Pos &a,const Pos &b)
{
if(a.y==b.y)
return a.x<b.x;
return a.y<b.y;
}
int main()
{
int n;
long long int ans=0;
scanf("%d",&n);
for(int i=0;i<n;++i)
{
scanf("%d %d",&pos[i].x,&pos[i].y);
}
sort(pos,pos+n,cmp1);
int tmp=0;
int temp=0;
for(int i=1;i<n;++i)
{
if(pos[i].x==pos[i-1].x)
{
++tmp;
ans+=tmp;
}
else
{
tmp=0;
}
}
sort(pos,pos+n,cmp2);
tmp=0;
for(int i=1;i<n;++i)
{
if(pos[i].y==pos[i-1].y)
{
++tmp;
ans+=tmp;
}
else
{
tmp=0;
}
}
for(int i=1;i<n;++i)
{
if(pos[i].x==pos[i-1].x&&pos[i].y==pos[i-1].y)
{
++temp;
ans-=temp;
}
else
{
temp=0;
}
}
printf("%I64d\n",ans);
return 0;
}