Sicily 1899. Stars

1899. Stars

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Lucy loves stars very much. There are N (1 <= N <= 1000) stars in the sky. Assume the sky is a flat plane. All of the stars lie on it with a location (x, y), -10000 <= x, y <= 10000. Now, Lucy wants you to tell her how many squares with each of four vertices formed by these stars, and the edges of the squares should parallel to the coordinate axes. 

Input

The first line of input is the number of test case.
The first line of each test case contains an integer N. The following N lines each contains two integers x, y, meaning the coordinates of the stars. All the coordinates are different. 

Output

For each test case, output the number of squares in a single line. 

Sample Input

2
1
1 2
4
0 0
1 0
1 1
0 1

Sample Output

0
1
// Problem#: 1899
// Submission#: 3590584
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
#include <string.h>

const int MAXN = 1000;
const int HASH_SIZE = 4096;

struct Point {
    int x, y;
    Point (int _x = 0, int _y = 0) {
        x = _x;
        y = _y;
    }
}stars[MAXN];

int head[HASH_SIZE];
int ptr[MAXN];

int hash(Point p) {
    return ((p.x * 20001 + p.y) % HASH_SIZE + HASH_SIZE) % HASH_SIZE;
}

int find(int x, int y) {
    int f = hash(Point(x, y));
    for (int i = head[f]; i >= 0; i = ptr[i])
        if (stars[i].x == x && stars[i].y == y) return 1;
    return 0;
}

int main() {
    int ts;
    scanf("%d", &ts);
    while (ts--) {
        int n;
        scanf("%d", &n);
        memset(head, -1, sizeof(head));
        for (int i = 0; i < n; i++) {
            scanf("%d%d", &stars[i].x, &stars[i].y);
            int f = hash(stars[i]);
            ptr[i] = head[f];
            head[f] = i;
        }
        int ret = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (!(stars[i].x < stars[j].x)) continue;
                if (stars[i].x - stars[j].x != stars[i].y - stars[j].y) continue;
                if (!find(stars[i].x, stars[j].y)) continue;
                if (!find(stars[j].x, stars[i].y)) continue;
                ret++;
            }
        }
        printf("%d\n", ret);
    }
    return 0;
}