1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
| #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
typedef long long LL;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
const int maxn=100005,K=2;
int D;
struct Point {
int dimension[K],Min[K],Max[K];
int lson,rson,id;
int& operator[] (int x) {
return dimension[x];
}
bool operator < (const Point& b) const {
return dimension[D]<b.dimension[D];
}
};
LL sqr(LL x) {
return x*x;
}
LL dist(Point a,Point b) {
LL ans=0;
for(int i=0; i<K; i++)ans+=sqr(a[i]-b[i]);
return ans;
}
struct QueNode {
LL v;
int id;
bool operator < (const QueNode& b) const {
return v>b.v||(v==b.v&&id<b.id);
}
};
struct KD_Tree {
Point p[maxn];
#define ls p[index].lson
#define rs p[index].rson
void update(int index) {
for(int i=0; i<K; i++) {
if(ls) {
p[index].Min[i]=min(p[index].Min[i],p[ls].Min[i]);
p[index].Max[i]=max(p[index].Max[i],p[ls].Max[i]);
}
if(rs) {
p[index].Min[i]=min(p[index].Min[i],p[rs].Min[i]);
p[index].Max[i]=max(p[index].Max[i],p[rs].Max[i]);
}
}
}
int build(int Left,int Right,int now) {
int mid=(Left+Right)>>1;
int root=mid;
D=now;
nth_element(p+Left,p+mid,p+Right+1);
for(int i=0; i<K; i++)p[root].Max[i]=p[root].Min[i]=p[root][i];
if(Left<mid)p[root].lson=build(Left,mid-1,(now+1)%K);
if(Right>mid)p[root].rson=build(mid+1,Right,(now+1)%K);
update(root);
return root;
}
LL get_max(int index,Point P) {
if(!index)return -INT_MAX;
LL ans=0;
for(int i=0; i<K; i++)ans+=max(sqr(p[index].Max[i]-P[i]),sqr(p[index].Min[i]-P[i]));
return ans;
}
priority_queue<QueNode>Q;
void find_max(int index,Point P) {
LL Dist=dist(p[index],P);
if(Dist>Q.top().v||(Dist==Q.top().v&&p[index].id<Q.top().id)) {
Q.pop();
Q.push((QueNode) {Dist,p[index].id});
}
LL ldist=get_max(p[index].lson,P),rdist=get_max(p[index].rson,P);
if(ldist>rdist) {
if(ldist>=Q.top().v)find_max(p[index].lson,P);
if(rdist>=Q.top().v)find_max(p[index].rson,P);
} else if(ldist<rdist) {
if(rdist>=Q.top().v)find_max(p[index].rson,P);
if(ldist>=Q.top().v)find_max(p[index].lson,P);
} else {
if(ldist>=Q.top().v)find_max(p[index].lson,P);
if(rdist>=Q.top().v)find_max(p[index].rson,P);
}
}
} tree;
int n,q,k,a[maxn][2];
int main() {
n=Get_Int();
for(int i=1; i<=n; i++) {
tree.p[i][0]=Get_Int();
tree.p[i][1]=Get_Int();
tree.p[i].id=i;
}
int root=tree.build(1,n,0);
q=Get_Int();
for(int i=1; i<=q; i++) {
Point p;
p[0]=Get_Int();
p[1]=Get_Int();
k=Get_Int();
tree.Q=priority_queue<QueNode>();
for(int i=1; i<=k; i++)tree.Q.push((QueNode) {-INT_MAX/2,0});
tree.find_max(root,p);
printf("%d\n",tree.Q.top().id);
}
return 0;
}
|
