[算法]距离问题

距离问题

又名: Pairs with same Manhattan and Euclidean distance

问题地址

问题描述

Description

In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A,B) such that

1. Point A and Point B do not coincide.
2. Manhattan Distance and the Euclidean Distance between the points should be equal.

Note : Pair of 2 points(A,B) is considered same as Pair of 2 points(B,A).

Manhattan Distance = |x2-x1|+|y2-y1|

Euclidean Distance = ((x2-x1)² + (y2-y1)²)^0.5 where points are (x1,y1) and (x2,y2).

Constraints:1<=T <= 50, 1<=N <= 2*10 ^ 5, 0<=(|Xi|, |Yi|) <= 10^9

Input

First Line Consist of T - number of test cases. For each Test case:First Line consist of N , Number of points. Next line contains N pairs contains two integers Xi and Yi，i.e, X coordinate and the Y coordinate of a Point

Output

Print the number of pairs as asked above.

Sample Input 1

1
2
1 1
7 5

Sample Output 1

0

题目解析

二维平面内,给定一堆不重复的点,求这些点两两组合后曼哈顿距离等于欧式距离的个数,

Manhattan Distance = |x2-x1|+|y2-y1|

Euclidean Distance = ((x2-x1)² + (y2-y1)²)^0.5

思路解析

令曼哈顿距离等于欧式距离,实际上是求下个式子的解:
$$|x2-x1|+|y2-y1|=sqrt((x2-x1{)}^2+(y2-y1{)}^2)$$

$$解得:x2=x1ory2=y1$$

$$\begin{gathered} 集合的思想: \\ (x2=x1ory2=y1)=(x2=x1)+(y2=y1)-(x2=x1andy2=y1) \end{gathered}$$

因此解题步骤如下

1. 统计横坐标相等的点的个数X_num
2. 统计纵坐标相等的点的个数Y_num
3. 统计横纵坐标相等的点的个数XY_num
4. 假设有X_num 个点横坐标相等,那可以组成的n * (n-1) /2对点X_pair = X_num* n * (n-1) /2
5. 答案就是X_pair + Y_pair -XY_pair

代码实现(python)

from collections import defaultdict

if __name__ == '__main__':
    case_num = int(input())
    for i in range(case_num):
        dict_x = defaultdict(int)  # 初始化一个默认值为0的map
        dict_y = defaultdict(int)
        dict_xy = defaultdict(int)
        point_num = int(input())
        for j in range(point_num):
            p = [int(x) for x in input().strip().split(" ")]
            dict_x[p[0]] += 1
            dict_y[p[1]] += 1
            dict_xy[tuple(p)] += 1
        x_pair_num = 0
        y_pair_num = 0
        xy_pair_num = 0
        for k, v in dict_x.items():
            x_pair_num += v * (v - 1) // 2
        for k, v in dict_y.items():
            y_pair_num += v * (v - 1) // 2
        for k, v in dict_xy.items():
            xy_pair_num += v * (v - 1) // 2
        print(x_pair_num + y_pair_num - xy_pair_num)