题意就是给出一些坐标和楼的高度,然后询问是给出一个点,问他左下方那片区域第k矮的楼高度。
思路比较容易可以想到,离线弄可以省去一维,因为我可以按x顺序从小到大插入线段树,在一个询问的时候,他前面所有x比他小的都已经被插入进去了,而x比他大的都没有插入,所以只需要看y了,题目还有一点k必定小于10,那么建线段树的时候就可以暴力保留该点(区间)前10个矮楼的高度,然后用一个数组去查询 [1, y ] 就可以了。
AC代码:
//#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-11
#define NMAX 1000000005
#define MOD 1000000007
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
char c;
int flag = 0;
ret=0;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c == '-')
{
flag = 1;
c = getchar();
}
while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
if(flag) ret = -ret;
}
int T[60005*4][12];
struct node
{
int x,y,h,pos;
bool operator<(const node &t) const
{
return (x==t.x)?y<t.y:x<t.x;
}
};
node lou[30005],que[30005];
map<int,int>mp;
int ha[22],ans[30005],yy[60005];
void build(int l, int r, int rt)
{
for(int i = 0; i < 10; i++) T[rt][i] = NMAX;
if(l == r) return;
int mid = (l+r)>>1;
build(lson);
build(rson);
}
void pushup(int rt)
{
int tmp[22];
for(int i = 0; i < 10; i++)
tmp[i] = T[rt<<1][i];
for(int i = 0; i < 10; i++)
tmp[i+10] = T[rt<<1|1][i];
sort(tmp,tmp+20);
for(int i = 0; i < 10; i++)
T[rt][i] = tmp[i];
}
void updata(int L, int k, int l, int r, int rt)
{
if(l == r)
{
T[rt][10] = k;
sort(T[rt],T[rt]+11);
return;
}
int mid = (l+r)>>1;
if(L <= mid)updata(L,k,lson);
else updata(L,k,rson);
pushup(rt);
}
void haha(int *a, int *b)
{
for(int i = 10; i < 20; i++)
a[i] = b[i-10];
sort(a,a+20);
}
void query(int L, int R, int l, int r, int rt)
{
if(L <= l && R >= r)
{
haha(ha,T[rt]);
return;
}
int mid = (l+r)>>1;
if(L <= mid) query(L,R,lson);
if(R > mid) query(L,R,rson);
}
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o4.txt","w",stdout);
#endif // GLQ
int n,m;
while(~scanf("%d%d",&n,&m))
{
mp.clear();
for(int i = 0; i < n; i++)
{
scanf("%d%d%d",&lou[i].x,&lou[i].y,&lou[i].h);
yy[i] = lou[i].y;
}
for(int i = 0; i < m; i++)
{
scanf("%d%d%d",&que[i].x,&que[i].y,&que[i].h);
que[i].pos = i;
yy[i+n] = que[i].y;
}
sort(yy,yy+n+m);
int nct = unique(yy,yy+n+m)-yy;
for(int i = 0; i < nct; i++)
mp[yy[i]] = i+1;
sort(lou,lou+n);
sort(que,que+m);
build(1,nct,1);
int i=0,j=0;
while(que[j].x < lou[i].x)
{
ans[que[j].pos] = -1;
j++;
}
while(i < n || j < m)
{
if(i < n) updata(mp[lou[i].y],lou[i].h,1,nct,1);
while(i >= n-1 || lou[i+1].x > que[j].x)
{
for(int i = 0; i < 10; i++) ha[i] = NMAX;
query(1,mp[que[j].y],1,nct,1);
ans[que[j].pos] = ha[que[j].h-1];
if(ans[que[j].pos] == NMAX) ans[que[j].pos] = -1;
j++;
if(j == m) break;
}
if(j == m) break;
i++;
}
for(int i = 0; i < m; i++)
printf("%d\n",ans[i]);
}
return 0;
}