CF Watchmen 【思维+数学】

原创 2016年05月30日 23:39:02
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.


题确实挺好的,明白了题意:求x1=x2||y1=y2的对数,直接循环出错

看博客思路,用结构题分别对x和y排序,算对数,再减x,y都相等时重复的


代码:

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

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

CF - 808B. Average Sleep - 前缀和思维

1.题目描述: B. Average Sleep Time time limit per test 1 second memory limit per test 25...

CF - 805D. Minimum number of steps - 思维+快速幂

1.题目描述: D. Minimum number of steps time limit per test 1 second memory limit per test 256 mega...

Codeforces 463D Gargari and Permutations【思维建图+Floyd跑最长路】不愧是CF的评测姬

D. Gargari and Permutations time limit per test 2 seconds memory limit per test 256 megabyte...

CF - 782E. Underground Lab - 思维+dfs

1.题目描述: E. Underground Lab time limit per test 1 second memory limit per t...

CF - 754A.Lesha and array splitting - 贪心+思维

1.题目描述: A. Lesha and array splitting time limit per test 2 seconds memory ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)