zoukankan      html  css  js  c++  java
  • CodeForces

    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
    Note

    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.

    思路:结果就是计算同一横坐标、纵坐标上有多少点,再减去可能重复的数量(用map,pair存一下)

    #include <iostream>
    #include <stdio.h>
    #include <algorithm>
    #include <cstring>
    #include <cmath>
    #include <stack>
    #include <map>
    using namespace std;
    #define ll long long
    ll a,b;
    map<ll,ll> mp1;
    map<ll,ll> mp2;
    map< pair<ll,ll>,ll> mp;
    int main()
    {
        int n,m;
        while(scanf("%d",&n)!=EOF){
            ll ans=0,num=0;
            mp1.clear();
            mp2.clear();
            mp.clear();
            for(int i=1;i<=n;i++){
                scanf("%lld%lld",&a,&b);
                num+=mp[make_pair(a,b)];
                mp[make_pair(a,b)]++;
                if(mp1.find(a)==mp1.end())
                    mp1[a]=1;
                else {
                    ans+=mp1[a];
                    mp1[a]++;
                }
                if(mp2.find(b)==mp2.end())
                    mp2[b]=1;
                else {
                    ans+=mp2[b];
                    mp2[b]++;
                }
            }
            printf("%lld",(ll)ans-num);
        }
        return 0;
    }
  • 相关阅读:
    同表自更新
    C#数据层添加事务功能
    Mysql 索引 分区 面试题
    Spring 循环依赖
    Zipkin初探 + 与SpringBoot的集成+ 使用HTTP方式传送数据给zipkin server
    Web调优之IBM JDK+liberty(二),原来都是UUID惹得祸
    Web调优之IBM JDK+liberty(一): Jmeter pod里压,50个线程并发测试,调整 -Xms -Xms, Log原来是大问题
    Linux使用jstat命令查看jvm的GC情况
    VM内存回收System.gc()
    prometheus 文档合集
  • 原文地址:https://www.cnblogs.com/wydxry/p/7245227.html
Copyright © 2011-2022 走看看