# Watchmen(Codeforces 650A)

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
31 17 51 5
output
2
input
60 00 10 2-1 10 11 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.

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAX_N 200005
using namespace std;

struct node{
__int64 x, y;
} dis[MAX_N];

bool cmp1(node a, node b) {
if (a.x == b.x) {
return a.y > b.y;
}
return a.x > b.x;
}
bool cmp2(node a, node b) {
return a.y > b.y;
}

int main() {
__int64 n;
while (scanf("%I64d", &n) != EOF) {
__int64 ans = 0;
for (__int64 i = 0; i < n; i++) {
scanf("%I64d%I64d", &dis[i].x, &dis[i].y);
}
__int64 cnt1 = 1, cnt2 = 1;
sort(dis, dis + n, cmp1);
for (__int64 i = 1; i < n;i++) {
if (dis[i - 1].x == dis[i].x) {
cnt1++;
if (dis[i - 1].y == dis[i].y) 	cnt2++;
else {
ans -= (cnt2 - 1) * cnt2 / 2;
cnt2 = 1;
}
}
else {
ans += cnt1 * (cnt1 - 1) / 2;
cnt1 = 1;
ans -= (cnt2 - 1) * cnt2 / 2;
cnt2 = 1;
}
}
ans += cnt1 * (cnt1 - 1) / 2 - cnt2 * (cnt2 - 1) / 2;
sort(dis, dis + n, cmp2);
cnt1 = 1;
for (int i = 1; i < n; i++) {
if (dis[i - 1].y == dis[i].y) {
if (dis[i - 1].y == dis[i].y) cnt1++;
}
else {
ans += cnt1 * (cnt1 - 1) / 2;
cnt1 = 1;
}
}
ans += cnt1 * (cnt1 - 1) / 2;
printf("%I64d\n", ans);
}
return 0;
}


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

## CodeForces 650A Watchmen

E - Watchmen Time Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submi...
• yao1373446012
• 2016年05月29日 11:43
• 182

## codeforces 650A Watchmen 【数学】

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

## CodeForces - 650A Watchmen （握手定理）

• DT2131
• 2017年01月13日 22:54
• 129

## Codeforces 650A Watchmen 【数学 + 二分】

• chenzhenyu123456
• 2016年03月09日 14:27
• 293

## Codeforces 650A Watchmen(数学，算法优化)

A. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input...
• zwj1452267376
• 2016年03月08日 21:58
• 631

## 【1】【组合数学】CodeForces 650A Watchmen

• sinat_35003880
• 2016年08月11日 10:53
• 47

## CodeForces650AWatchmen

Description Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiber...
• zhaihao1996
• 2016年05月26日 10:49
• 121

## CF 650A Watchmen

A. Watchmen time limit per test3 seconds memory limit per test256 megabytes inputstandard input ...
• u011151784
• 2016年03月13日 13:31
• 334

## Codeforces Round #345 (Div. 1) & CodeForces 650A Watchmen

A. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input standard i...
• Jone__
• 2016年04月05日 20:51
• 189

## codeforces 651C. Watchmen(排列，去重)

• hkh746392783
• 2016年03月08日 14:08
• 733

举报原因： 您举报文章：Watchmen(Codeforces 650A) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)