zoukankan      html  css  js  c++  java
  • Wet Shark and Bishops(思维)

    Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right.

    Wet Shark thinks that two bishops attack each other if they share the same diagonal. Note, that this is the only criteria, so two bishops may attack each other (according to Wet Shark) even if there is another bishop located between them. Now Wet Shark wants to count the number of pairs of bishops that attack each other.

    Input

    The first line of the input contains n (1 ≤ n ≤ 200 000) — the number of bishops.

    Each of next n lines contains two space separated integers xi and yi (1 ≤ xi, yi ≤ 1000) — the number of row and the number of column where i-th bishop is positioned. It's guaranteed that no two bishops share the same position.

    Output

    Output one integer — the number of pairs of bishops which attack each other.

    Example

    Input
    5
    1 1
    1 5
    3 3
    5 1
    5 5
    Output
    6
    Input
    3
    1 1
    2 3
    3 5
    Output
    0

    Note

    In the first sample following pairs of bishops attack each other: (1, 3), (1, 5), (2, 3), (2, 4), (3, 4) and (3, 5). Pairs (1, 2), (1, 4), (2, 5) and (4, 5) do not attack each other because they do not share the same diagonal.

    题意:在对角线上的相会相互攻击,求出能够相互攻击的相的对数?

    题解:仔细观察能够发现,在同一对角线上的相满足x+y or x-y相等,这里需要注意的是x-y可能会出现负数,所以这里用x-y+3000来代替x-y

    AC代码

    #include<stdio.h>
    #include<string.h>
    
    int main()
    {
        int n;
        int x, y;
        int attack[5000];
        int sum;
        while(~scanf("%d", &n))
        {
            sum = 0;
            memset(attack, 0, sizeof(attack));
            for(int i = 0; i < n; i++)
            {
                scanf("%d %d", &x, &y);
                attack[x+y]++;
                attack[x-y+3000]++;
            }
            for(int i = 0; i < 5000; i++)
            {
                if(attack[i] > 1)
                    sum += attack[i]*(attack[i]-1)/2;
            }
            printf("%d
    ", sum);
        }
    
        return 0;
    }
    View Code
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    MySQL对于数据库应该如何如何配置安全问题了
    对于改善 MySQL 数据装载操作有效率的方法是怎样
    MySQL与SQL比较有那些区别呢
    Centos6.5和Centos7 php环境搭建如何实现呢
    php单例模式是怎么实现的呢
    PHP编写的图片验证码类文件分享方法
    PHP中header函数的用法及其注意重点是什么呢
    java正则表达式四种常用的处理方式是怎么样呢《匹配、分割、代替、获取》
    PHP弱类型安全问题的写法和步骤
    vs2010 使用IIS EXPRESS出错.
  • 原文地址:https://www.cnblogs.com/h-hkai/p/8525560.html
Copyright © 2011-2022 走看看