计算几何专题(四)

题意:给定平面和上n个点,判断平面物理距离等=等于曼哈顿距离的点的对数

>> face <<

Strategy:

$${D_1}^2=(x_1-x_2{)}^2+(y_1-y_2{)}^2$$
$${D_2}^2=(\mid x_1-x_2\mid +\mid y_1-y_2\mid {)}^2=(x_1-x_2{)}^2+2\mid x_1-x_2\mid \mid y_1-y_2\mid +(y_1-y_2{)}^2$$
$${D_1}^2={D_2}^2\Rightarrow \mid x_1-x_2\mid \mid y_1-y_2\mid =0$$

也就是说 当且仅当 两点的横坐标相同或者纵坐标相同时,题设成立, 于是我们就可以用map 维护一个点出现的次数, 再用两个哈希表维护横纵坐标出现的次数, 那么 每一个点对答案的贡献就是 该点横坐标出现的次数加上纵坐标出现的次数,减去该点出现的次数(有重复的点) 注意开 long long

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define oo INT_MAX
#define ll long long
#define db double
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()
#define met(a, b) memset(a, b, sizeof(a))
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define lowbit(x) x &(-x)
#define pi acos(-1.0)
using namespace std;
using namespace __gnu_pbds;
const int maxn = 189;
// FILE *o = freopen("C:\\Users\\Jason.Z\\Desktop\\in.txt", "r", stdin);
// assert(o != NULL);
// FILE *e = freopen("C:\\Users\\Jason.Z\\Desktop\\out.txt", "w", stdout);
// assert(e != NULL);
map <pair<int, int>, ll> q;
gp_hash_table <int, int> x, y;
int main(){
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    ll ans = 0;
    _rep(i, 1, n){
        int xx, yy;
        cin >> xx >> yy;
        ans += x[xx];
        ans += y[yy];
        x[xx]++, y[yy]++;
        ans -= q[{xx, yy}];
        q[{xx, yy}]++;
    }
    cout << ans << endl;
}