A. Watchmen

https://codeforc.es/problemset/problem/650/A

题意：有多少对点的曼哈顿距离等于欧几里得距离；

思路：map一下x轴和y轴上的点，再组合一下，然后要减去重点，重点也减组合数的的数量，（一开始只是加一.....）；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

double Dis(int x1,int y1,int x2,int y2)
{
    return sqrt((double)(x1-x2)*(x1-x2)+(double)(y1-y2)*(y1-y2));
}

map<int,int>mpx,mpy;
map<pair<int,int>,int>vis;
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        int x,y;
        cin>>x>>y;
        if(vis[{x,y}])
        {
            //fl();
        }
        vis[{x,y}]++;
        mpx[x]++;
        mpy[y]++;

    }
    for(map<int,int>::iterator it=mpx.begin();it!=mpx.end();it++)
    {
        //cout<<it->first<<endl;
        if(it->second>1)
        {
            ans=ans+(ll)(it->second)*(it->second-1)/2;
        }
    }
    //cout<<ans<<endl;
    for(map<int,int>::iterator it=mpy.begin();it!=mpy.end();it++)
    {

        if(it->second>1)
        {
            //cout<<it->second<<endl;
            ans=ans+(ll)(it->second)*(it->second-1)/2;
        }
    }
    for(map<pair<int,int>,int >::iterator it=vis.begin();it!=vis.end();it++)
    {
        if(it->second>1)
        {
            //cout<<it->second<<endl;
            ans=ans-(ll)(it->second)*(it->second-1)/2;
        }
    }
    cout<<ans<<endl;
    return 0;
}