两种做法:
1、dfs序列然后区间统计修改
2、分块
事实上这题存在一些问题 在题目中写的是higher 但是事实上要用>=
神坑!
#pragma comment(linker,"/STACK:102400000,102400000")
#include<vector>
#include<stdio.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<string.h>
#include<map>
using namespace std;
#define ls (rt<<1)
#define rs (rt<<1|1)
#define mid ((l+r)>>1)
#define maxn 222222
int mx[maxn<<2];
void up(int rt,int l,int r){
mx[rt]=max(mx[ls],mx[rs]);
}
void build(int rt,int l,int r){
mx[rt]=-1;
if(l==r)return ;
build(ls,l,mid);
build(rs,mid+1,r);
}
void ins(int rt,int l,int r,int L,int R,int w){
if(L<=l&&r<=R){
mx[rt]=w;
return ;
}
if(L<=mid)ins(ls,l,mid,L,R,w);
if(mid<R)ins(rs,mid+1,r,L,R,w);
up(rt,l,r);
}
int query(int rt,int l,int r,int L,int R){
if(L<=l&&r<=R){
return mx[rt];
}
int ans=-1;
if(L<=mid)ans=max(ans,query(ls,l,mid,L,R));
if(mid<R)ans=max(ans,query(rs,mid+1,r,L,R));
return ans;
}
int L[maxn],R[maxn],clc;
vector<int>g[maxn];
void dfs(int u){
L[u]=++clc;
for(int i=0;i<g[u].size();++i)
dfs(g[u][i]);
R[u]=++clc;
}
int n,m;
int ans[maxn];
void init(){
for(int i=0;i<=n;++i)g[i].clear();
memset(ans,-1,sizeof ans);
clc=-1;
build(1,1,maxn);
}
struct Man{
int abi,loy,id;
}man[maxn];
int cmp(Man x,Man y){
if(x.abi!=y.abi)return x.abi>y.abi;
return x.id<y.id;
}
int main()
{
int t,a,b,c;
scanf("%d",&t);
while(t--){
map<int,int>mp;
scanf("%d%d",&n,&m);
init();
n--;
for(int i=1;i<=n;++i){
scanf("%d%d%d",&a,&b,&c);
g[a].push_back(i);
man[i].loy=b;
man[i].abi=c;
man[i].id=i;
mp[b]=i;
}
dfs(0);
sort(man+1,man+n+1,cmp);
for(int i=1;i<=n;++i){
int loy=query(1,1,maxn,L[man[i].id],R[man[i].id]);
if(loy<0)ans[man[i].id]=-1;
else ans[man[i].id]=mp[loy];
ins(1,1,maxn,L[man[i].id],L[man[i].id],man[i].loy);
}
for(int i=0;i<m;++i){
scanf("%d",&c);
printf("%d\n",ans[c]);
}
}
return 0;
}