【1】【组合数学】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.

链接
CodeForces 650A

题意
给出n个坐标，求直线距离与曼哈顿距离相等的坐标有几对，坐标会出现重复。

分析
16/8/10题意很清楚，就是找出那些x坐标相同的组合一下，然后找出y坐标相同的组合一下，最后要删掉那些x和y坐标都相同的重复计算的组合数。这里在处理重复的时候很容易出错，所以wa了几遍。