# CF Watchmen 【思维+数学】

E - Watchmen
Time Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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

Sample Input

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


Hint

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 <cstdio>
#include <algorithm>
using namespace std;
struct Node
{
int x;
int y;
}a[200005];
int cmp1(Node a,Node b)
{
if(a.x==b.x)
return a.y<b.y;
return a.x<b.x;
}
int cmp2(Node a,Node b)
{
if(a.y==b.y)
return a.x<b.x;
return a.y<b.y;
}
int main()
{
int n,i,j;
long long ans,cnt,sum;
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
scanf("%d%d",&a[i].x,&a[i].y);
ans=1;
cnt=1;
sum=0;
sort(a,a+n,cmp1);//第一次求对数
for(i=1;i<n;i++)
{
if(a[i].x==a[i-1].x)
{
ans++;
if(a[i].y==a[i-1].y)//重复的对数
{
cnt++;
}
else
{
sum-=cnt*(cnt-1)/2;
cnt=1;
}
}
else
{
sum+=ans*(ans-1)/2;
sum-=cnt*(cnt-1)/2;
cnt=1;
ans=1;
}
}
if(ans!=1)
sum+=ans*(ans-1)/2;
if(cnt!=1)
sum-=cnt*(cnt-1)/2;
sort(a,a+n,cmp2);//第二次求对数
ans=1;
for(i=1;i<n;i++)
{
if(a[i].y==a[i-1].y)
{
ans++;
}
else
{
sum+=ans*(ans-1)/2;
ans=1;
}
}
if(ans!=1)
{
sum+=ans*(ans-1)/2;
}
printf("%lld\n",sum);
}
return 0;
}


• 本文已收录于以下专栏：

## CF - 807C. Success Rate - 二分+思维+数学

1.题目描述： C. Success Rate time limit per test 2 seconds memory limit per test 256 meg...

## 数学算法：CF534A-Exam(思维)

Exam An exam for n students will take place in a long and narrow room, so the students will sit in a...

## cf（数学思维题）

Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Ea...

## cf（思维，数学）

B. Duff in Love time limit per test 2 seconds memory limit per test 256 megabytes i...

## Codeforces 651 C Watchmen【思维】

C. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input stan...

## codeforces 650A Watchmen 【数学】

A. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input...
• wyjwyl
• 2016年03月08日 17:07
• 247

## CF 135 DIV2 B Special Offer! Super Price 999 Bourles! 思维

time limit per test 1 second memory limit per test 256 megabytes input standard input output s...

## CF#798 B. Mike and strings（思维）

B. Mike and strings time limit per test 2 seconds memory limit per test 256 megabytes ...

## CF - 785B. Anton and Classes - 思维

1.题目描述： B. Anton and Classes time limit per test 4 seconds memory limit per test 25...

## CF - 584B. Kolya and Tanya - 快速幂+思维

1.题目描述： B. Kolya and Tanya time limit per test 1 second memory limit per test 256 m...

举报原因： 您举报文章：CF Watchmen 【思维+数学】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)