Codeforces Round #341 (Div. 2) CF621B. Wet Shark and Bishops(排列组合+对角线规律)

B. Wet Shark and Bishops
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Sample test(s)
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.
题意：
题意就是说有个1000*1000的网格，并给出n个点的坐标，当两个点共享一条对角线的时候满足可以互相攻击的条件。问在同一条对角线上可以互相攻击的点对共有多少。

思路：
每一条对角线上的点数首先统计出来，注意：此处对角线有主对角线(存在ss数组中)和副对角线(存在str数组中)之分，切记分清每条对角线。依次求每个点的组合数并累加。说实话题目我居然看了半个小时，看到别人都是几分钟看完题目顺便打完代码一遍过，真是惭愧(:з」∠)。。。

#include<bits/stdc++.h>
using namespace std;
long long res (int n)   //求C(n,2)的组合数结果
{
    if(n == 2)
        return 1;
    long long ans = 1;
    for(int i = n;i >= n - 2 + 1;i--)
        ans *= i;
    return ans / 2;
}
long long str[2002],ss[2002];
int main()
{
    int n;
    while(cin>>n)
    {
        memset(str,0,sizeof(str));
        memset(ss,0,sizeof(ss));
        for(int i = 0;i < n;i++)
        {
            int a,b;
            cin>>a>>b;
            str[a + b]++;
            ss[a - b + 1000]++;
        }
        long long ans = 0;
        for(int i = 0;i < 2002;i++)
        {
            ans += res(str[i]);
            ans += res(ss[i]);
        }
        cout<<ans<<endl;
    }
    return 0;
}