CodeForces 893F :Subtree Minimum Query 主席树

传送门

题意

给你一棵树，$n$个节点,每个点有一个权值$a_i$且每条边长度为$1$，$m$次询问，求以$x_i$为根的子树中到$x_i$的距离小于等于$k_i$ 的最小点权值（强制在线）

分析

一般这种跟深度有关系的问题都是把深度看成一个桶来处理
但是这题高级一点，要求一个深度区间内的最小值
子树可以看成$dfs$序上连续的一段，也就是求区间上的最小值，还要保存每一个深度版本，直接主席树就好了

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e5 + 10,M = 2 * N;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
    int l,r;
    int x;
}tr[N * 4 + N * 17];
int h[N],ne[M],e[M],num;
int root[N],idx;
int in[N],out[N],cnt;
int n,r,m;
int D;
int w[N];
int din[N];
VI dout[N];

void add(int x,int y){
    ne[num] = h[x],e[num] = y,h[x] = num++;
}

void push(int u){
	tr[u].x = min(tr[tr[u].l].x,tr[tr[u].r].x);
}

int build(int l,int r){
    int p = ++idx;
    if(l == r) {
    	tr[p].x = INF;
    	return p;
    }
    int mid = (l + r) >> 1;
    tr[p].l = build(l,mid),tr[p].r= build(mid + 1,r);
    push(p);
    return p;
}

int insert(int p,int l,int r,int x,int k){
    int q = ++idx;
    tr[q] = tr[p];
    if(l == r){
        tr[q].x = k;
        return q;
    }
    int mid = (l + r) >> 1;
    if(x <= mid) tr[q].l = insert(tr[p].l,l,mid,x,k);
    else tr[q].r = insert(tr[p].r,mid + 1,r,x,k);
    push(q);
    return q;
}

void dfs(int u,int fa,int d){
	D = max(D,d);
    in[u] = ++cnt;
    din[u] = d;
    dout[d].pb(u);
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u,d + 1);
    }
    out[u] = cnt;
}

int query(int p,int l,int r,int L,int R){
	if(l >= L && r <= R) return tr[p].x;
	int mid = (l + r) >> 1;
	int x = INF;
	if(L <= mid) x = query(tr[p].l,l,mid,L,R);
	if(R > mid) x = min(x,query(tr[p].r,mid + 1,r,L,R));
	return x; 
}


int main() {
	memset(h,-1,sizeof h);
	read(n),read(r);
	root[0] = build(1,n);
	for(int i = 1;i <= n;i++) read(w[i]);
	for(int i = 1;i < n;i++){
		int a,b;
		read(a),read(b);
		add(a,b),add(b,a);
	}
	dfs(r,-1,1);
	for(int i = 1;i <= D;i++){
		int x = dout[i][0];
		root[i] = insert(root[i - 1],1,n,in[x],w[x]);
		for(int j = 1;j < dout[i].size();j++) {
			x = dout[i][j];
			root[i] = insert(root[i],1,n,in[x],w[x]);
		}
	}
	read(m);
	int last = 0;
	while(m--){
		int a,b;
		read(a),read(b);
		a = (a + last) % n + 1;
		b = (b + last) % n;
		last = query(root[min(D,din[a] + b)],1,n,in[a],out[a]);
		di(last);
	}
	return 0;
}