[HDU 2966]In case of failure

Description

To help their clients deal with faulty Cash Machines, the board of The Planar Bank has decided to stick a label expressing sincere regret and sorrow of the bank about the failure on every ATM. The very same label would gently ask the customer to calmly head to the nearest Machine (that should hopefully
work fine).
In order to do so, a list of two-dimensional locations of all n ATMs has been prepared, and your task is to find for each of them the one closest with respect to the Euclidean distance.

Input

The input contains several test cases. The very first line contains the number of cases t (t <= 15) that follow. Each test cases begin with the number of Cash Machines n (2 <= n <= 10^5). Each of the next n lines contain the coordinates of one Cash Machine x,y (0 <= x,y <=10^9) separated by a space. No two
points in one test case will coincide.

Output

For each test case output n lines. i-th of them should contain the squared distance between the i-th ATM from the input and its nearest neighbour.

Sample Input

2 10 17 41 0 34 24 19 8 28 14 12 45 5 27 31 41 11 42 45 36 27 15 0 0 1 2 2 3 3 2 4 0 8 4 7 4 6 3 6 1 8 0 11 0 12 2 13 1 14 2 15 0

Sample Output

200 100 149 100 149 52 97 52 360 97 5 2 2 2 5 1 1 2 4 5 5 2 2 2 5

题目大意

求平面最近点对。

题解

裸的$KD-tree$。

我们用线性结构来存储这颗树，其主要思想是将一段区间内的元素中间那个元素作为根节点，其余作为左右子树，用个决策函数来划分。

询问的时候就比较暴力...其主要就是通过根节点以及其与子树的关系来优化搜索过程。

//It is made by Awson on 2017.11.25
#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define LD long double
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define dist(a, b, c, d) (sqr(a-c)+sqr(b-d))
#define sqr(x) ((x)*(x))
#define y1 yy
#define count COUNT
using namespace std;
const int N = 1e5;

int n, now;
LL ans;
struct tt {
  LL x[2];
  bool operator < (const tt &b) const {
    return x[now] < b.x[now];
  }
}a[N+5], b[N+5];
struct KD_tree {
  void build(int l, int r, int flag) {
    if (l >= r) return;
    now = flag;
    int mid = (l+r)>>1;
    nth_element(a+l, a+mid, a+r+1);
    build(l, mid-1, flag^1); build(mid+1, r, flag^1);
  }
  void query(int l, int r, int flag, tt p) {
    if (l > r) return;
    int mid = (l+r)>>1;
    LL tmp = dist(a[mid].x[0], a[mid].x[1], p.x[0], p.x[1]);
    if (tmp && tmp < ans) ans = tmp;
    if (a[mid].x[flag] < p.x[flag]) {
      query(mid+1, r, flag^1, p);
      if (ans > sqr(a[mid].x[flag]-p.x[flag])) 
    query(l, mid-1, flag^1, p);
    }else {
      query(l, mid-1, flag^1, p);
      if (ans > sqr(a[mid].x[flag]-p.x[flag])) 
    query(mid+1, r, flag^1, p);
    }
  }
}kd;

void work() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", &a[i].x[0], &a[i].x[1]);
    b[i] = a[i];
  }
  kd.build(1, n, 0);
  for (int i = 1; i <= n; i++) {
    ans = 1e18;
    kd.query(1, n, 0, b[i]);
    printf("%lld\n", ans);
  }
}
int main() {
  int t; cin >> t;
  while (t--) work();
  return 0;
}