Codeforces Round #345 (Div. 2) 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 (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.

题意：用两种方式（1.d=|xi - xj| + |yi - yj|；2. d=）计算平面上任意两点之间的距离，当两者得到的答案相同时，答案加1，输入n个点的坐标，输出答案。

从n<=2*1e5可以看出直接暴力的话会超时，因为任意两点之间都要计算的话，需要两重循环，n能达到4*1e10的次数，TLE是肯定的。从两种方式上分析，1.d=|xi - xj| + |yi - yj|；2. d=，可知当二者的xi=xj或者yi=yj时，计算出的距离是一样的，从而我们可以之间看xi=xj或者yi=yj相同的有多少对，通过sort进行两次排序，第一次排序比较xi和xi-1，第二次比较yi和yi-1，得出samenum在通过排列组合计算出答案数=sanmenum*(samenum-1)/2，需要注意的是，当xi=xi-1且yi=yi-1时候，用两次排序计算的结果重复算了一次，我们还需要统计这种情况出现的次数，在答案上减去重复的排列组合数。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=200005;
struct N{
    int a,b;
}num[maxn];
int n;
long long samenum=1,allsamenum=1,ans=0;
bool cmp1(N a,N b)
{
    if(a.a==b.a)return a.b<b.b;
    return a.a<b.a;
}
bool cmp2(N a,N b)
{
    if(a.b==b.b)return a.a<b.a;
    return a.b<b.b;
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>num[i].a>>num[i].b;
    }
    sort(num,num+n,cmp1);
    for(int i=1;i<n;i++){
        if(num[i].a==num[i-1].a){
            samenum++;
            if(num[i].b==num[i-1].b){
                allsamenum++;
            }
            else{
                ans-=allsamenum*(allsamenum-1)/2;
                allsamenum=1;
            }
        }
        else{
            ans+=samenum*(samenum-1)/2;
            ans-=allsamenum*(allsamenum-1)/2;
            allsamenum=1;
            samenum=1;
        }
    }
    if(allsamenum!=1){
        ans-=allsamenum*(allsamenum-1)/2;
        allsamenum=1;
    }
    if(samenum!=1){
        ans+=samenum*(samenum-1)/2;
        samenum=1;
    }
    sort(num,num+n,cmp2);
    for(int i=1;i<n;i++){
        if(num[i].b==num[i-1].b){
            samenum++;
        }
        else{
            ans+=samenum*(samenum-1)/2;
            samenum=1;
        }
    }
    if(samenum!=1){
        ans+=samenum*(samenum-1)/2;
    }
    cout<<ans<<endl;

    return 0;
}