Codeforces Round #341 (Div. 2) B. Wet Shark and Bishops

B. Wet Shark and Bishops

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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 x_i and y_i (1 ≤ x_i, y_i ≤ 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.

题意:给出n个点,求出每个点与其他点共对角线的个数,计算所有点的个数之和

分析:每给出1个点,都会形成两条对角线,这两条对角线都会与第一行形成一个交点(虽然可能在（1，1）-（n,n）形成的方格外面)

所以我们每加入一个点,统计与第一行已经形成的交点个数,累加

#include<bits/stdc++.h>
using namespace std;
int dp1[4001],dp2[4001];

int main(){
    int n;
    __int64 ans=0;
    scanf("%d",&n);
    int x,y;
    for(int i=1;i<=n;i++){
        scanf("%d%d",&x,&y);
        ans+=dp1[x+y-1];
        dp1[x+y-1]++;
        ans+=dp2[y-x+1+1000];
        dp2[y-x+1+1000]++;
    }
    printf("%I64d\n",ans);
    return 0;
}