Codeforces650A 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 (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.

题意：有很多的坐标（可能相同），求有多少对坐标的曼哈顿距离和两点直线距离相等。

思路：要使得上述成立，两点的x坐标和y坐标必须至少一个相等，n个点之间不重复的组合有n(n-1)/2个，先按x坐标排序，把x坐标相等的组合数加起来，再按y坐标排序，把y坐标相等的组合数加起来。现在如果存在相同的点的话，它们之间就存在重复计算，每一种相同的点，如果有n个，那么就多算了n(n-1)/2次，减去后得到结果。

include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define ll long long int
#define maxn 200005
struct node{
    ll x, y;
} a[maxn], b[maxn];
bool cmp1(node A, node B){
    return A.x < B.x;
}
bool cmp2(node A, node B){
    if(A.y == B.y) return A.x < B.x;
    return A.y < B.y;
}
ll func(ll n){
    ll res = 0;
    for(ll i = n - 1;i >= 1;i--)
        res += i;
    return res;
}
int main()
{
    ll n, i, p, s;
    ll res = 0;
    scanf("%I64d", &n);
    for(i = 0;i < n;i++){
        scanf("%I64d %I64d", &a[i].x, &a[i].y);
    }
    sort(a, a + n, cmp2);
    p = 1;
    for(i = 1;i < n;i++){
        if(a[i].x==a[i-1].x&&a[i].y==a[i-1].y) p++;
        else{
            res -= (p*(p-1)/2);
            p = 1;
        }
    }
    if(a[n-1].x==a[n-2].x&&a[n-1].y==a[n-2].y) res -= (p*(p-1)/2);
    s = 0;
    for(i = 0;i < n;i++)
    {
        s++;
        if(i < n-1&&a[i].y != a[i+1].y){
            res += s*(s-1)/2;
            s = 0;
        }
        if(i == n-1&&a[i].y == a[i-1].y){
            res += s*(s-1)/2;
        }
    }
    //printf("-%I64d\n", res);
    s = 0;
    sort(a, a + n, cmp1);
    for(i = 0;i < n;i++)
    {
        s++;
        if(i < n-1&&a[i].x != a[i+1].x){
            res += s*(s-1)/2;
            s = 0;
        }
        if(i == n-1&&a[i].x == a[i-1].x){
            res += s*(s-1)/2;
        }
    }
    printf("%I64d\n", res);
}