Finding Hotels

Finding Hotels

http://acm.hdu.edu.cn/showproblem.php?pid=5992

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
Total Submission(s): 2180    Accepted Submission(s): 688

Problem Description

There are N hotels all over the world. Each hotel has a location and a price. M guests want to find a hotel with an acceptable price and a minimum distance from their locations. The distances are measured in Euclidean metric.

 

Input

The first line is the number of test cases. For each test case, the first line contains two integers N (N ≤ 200000) and M (M ≤ 20000). Each of the following N lines describes a hotel with 3 integers x (1 ≤ x ≤ N), y (1 ≤ y ≤ N) and c (1 ≤ c ≤ N), in which x and y are the coordinates of the hotel, c is its price. It is guaranteed that each of the N hotels has distinct x, distinct y, and distinct c. Then each of the following M lines describes the query of a guest with 3 integers x (1 ≤ x ≤ N), y (1 ≤ y ≤ N) and c (1 ≤ c ≤ N), in which x and y are the coordinates of the guest, c is the maximum acceptable price of the guest.

 

Output

For each guests query, output the hotel that the price is acceptable and is nearest to the guests location. If there are multiple hotels with acceptable prices and minimum distances, output the first one.

 

Sample Input

2

3 3

1 1 1

3 2 3

2 3 2

2 2 1

2 2 2

2 2 3

5 5

1 4 4

2 1 2

4 5 3

5 2 1

3 3 5

3 3 1

3 3 2

3 3 3

3 3 4

3 3 5

 

Sample Output

1 1 1

2 3 2

3 2 3

5 2 1

2 1 2

2 1 2

1 4 4

3 3 5

 

Source

2016ACM/ICPC亚洲区青岛站-重现赛（感谢中国石油大学）

结构体内用友元函数这题会T....

模板题

#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define N 200005
using namespace std;

int n,m,id;//n是点数,m是维度,id是当前切的维度

struct sair{
    long long p[5];
    bool operator<(const sair &b)const{
        return p[id]<b.p[id];
    }
}_data[N],data[N<<3],tt[N];
int flag[N<<3];

priority_queue<pair<long long,sair> >Q;

void build(int l,int r,int rt,int dep){
    if(l>r) return;
    flag[rt]=1;
    flag[rt<<1]=flag[rt<<1|1]=-1;
    id=dep%m;
    int mid=l+r>>1;
    nth_element(_data+l,_data+mid,_data+r+1);
    data[rt]=_data[mid];
    build(l,mid-1,rt<<1,dep+1);
    build(mid+1,r,rt<<1|1,dep+1);
}

void query(sair p,int k,int rt,int dep){
    if(flag[rt]==-1) return;
    pair<long long,sair> cur(0,data[rt]);//获得当前节点
    for(int i=0;i<m;i++){//计算当前节点到P点的距离
        cur.first+=(cur.second.p[i]-p.p[i])*(cur.second.p[i]-p.p[i]);
    }
    int idx=dep%m;
    int fg=0;
    int x=rt<<1;
    int y=rt<<1|1;
    if(p.p[idx]>=data[rt].p[idx]) swap(x,y);
    if(~flag[x]) query(p,k,x,dep+1);
    //开始回溯
    if(Q.size()<k){
        if(cur.second.p[2]<=p.p[2]){
            Q.push(cur);
        }
        fg=1;
    }
    else{
        if(cur.first<=Q.top().first&&cur.second.p[2]<=p.p[2]){
            if(cur.first==Q.top().first){
                if(cur.second.p[3]<Q.top().second.p[3]){
                    Q.pop();
                    Q.push(cur);
                }
            }
            else{
                Q.pop();
                Q.push(cur);
            }
        }
        if(((p.p[idx]-data[rt].p[idx])*(p.p[idx]-data[rt].p[idx]))<Q.top().first){
            fg=1;
        }
    }
    if(~flag[y]&&fg){
        query(p,k,y,dep+1);
    }
}

sair ans;


int main(){
    int T;
    scanf("%d",&T);
    int k;
    while(T--){
        scanf("%d %d",&n,&k);
        m=2;
        for(int i=1;i<=n;i++){
            scanf("%lld %lld %lld",&_data[i].p[0],&_data[i].p[1],&_data[i].p[2]);
            _data[i].p[3]=i;
        }
        build(1,n,1,0);
        sair tmp;
        for(int i=1;i<=k;i++){
            while(!Q.empty()){
                Q.pop();
            }
            scanf("%lld %lld %lld",&tmp.p[0],&tmp.p[1],&tmp.p[2]);
            tmp.p[3]=0x3f3f3f3f;
            query(tmp,1,1,0);
            ans=Q.top().second;
            Q.pop();
            printf("%lld %lld %lld
",ans.p[0],ans.p[1],ans.p[2]);
        }
    }
}