CodeForces 651C Watchmen map

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

 题目大意:

给你很多组a,b  然后通过两种计算方法判断答案是否相同
1.  |xi-xj|+|yi-yj|
2. sqrt((xi-xj)*(xi-xj) + (yi-yj)*(yi-yj))
 
题解:发现只有当xi = xj 或 yi = yj时答案相同
但同时要排除(xi,yi)=(xj,yj)的情况
复制代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<int, int> mapx, mapy;
map<pair<int, int>, int> mapp;
int main()
{
    int n, x, y;
    scanf("%d", &n);
    mapx.clear();
    mapy.clear();
    mapp.clear();
    for (int k = 1; k <= n; k++)
    {
        scanf("%d%d", &x, &y);
        mapx[x]++;
        mapy[y]++;
        mapp[pair<int, int>(x, y)]++;
    }
    ll ans = 0;
    map<int, int>::iterator i;
    int tem;
    for (i = mapx.begin(); i != mapx.end(); i++)
    {
        tem = i->second;
        ans += (ll)tem * (tem - 1) / 2;
    }
    for (i = mapy.begin(); i != mapy.end(); i++)
    {
        tem = i->second;
        ans += (ll)tem * (tem - 1) / 2;
    }
    for (map<pair<int, int>, int>::iterator j = mapp.begin(); j != mapp.end(); j++)
    {
        tem = j->second;
        ans -= (ll)tem * (tem - 1) / 2;
    }
    printf("%I64d\n", ans);
    return 0;
}
复制代码

 

posted on   2855669158  阅读(212)  评论(0编辑  收藏  举报

编辑推荐:
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
· .NET 9 new features-C#13新的锁类型和语义
· Linux系统下SQL Server数据库镜像配置全流程详解
阅读排行:
· Sdcb Chats 技术博客:数据库 ID 选型的曲折之路 - 从 Guid 到自增 ID,再到
· 语音处理 开源项目 EchoSharp
· 《HelloGitHub》第 106 期
· mysql8.0无备份通过idb文件恢复数据过程、idb文件修复和tablespace id不一致处
· 使用 Dify + LLM 构建精确任务处理应用

导航

< 2025年1月 >
29 30 31 1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31 1
2 3 4 5 6 7 8

统计

点击右上角即可分享
微信分享提示