#6046. 「雅礼集训 2017 Day8」爷 [分块]

分块板子。。/fad

// powered by c++11
// by Isaunoya
#include <bits/stdc++.h>
#define rep(i, x, y) for (register int i = (x); i <= (y); ++i)
#define Rep(i, x, y) for (register int i = (x); i >= (y); --i)
using namespace std;
using db = double;
using ll = long long;
using uint = unsigned int;
#define Tp template
using pii = pair<int, int>;
#define fir first
#define sec second
Tp<class T> void cmax(T& x, const T& y) {if (x < y) x = y;} Tp<class T> void cmin(T& x, const T& y) {if (x > y) x = y;}
#define all(v) v.begin(), v.end()
#define sz(v) ((int)v.size())
#define pb emplace_back
Tp<class T> void sort(vector<T>& v) { sort(all(v)); } Tp<class T> void reverse(vector<T>& v) { reverse(all(v)); }
Tp<class T> void unique(vector<T>& v) { sort(all(v)), v.erase(unique(all(v)), v.end()); }
const int SZ = 1 << 23 | 233;
struct FILEIN { char qwq[SZ], *S = qwq, *T = qwq, ch;
#ifdef __WIN64
#define GETC getchar
#else
  char GETC() { return (S == T) && (T = (S = qwq) + fread(qwq, 1, SZ, stdin), S == T) ? EOF : *S++; }
#endif
  FILEIN& operator>>(char& c) {while (isspace(c = GETC()));return *this;}
  FILEIN& operator>>(string& s) {while (isspace(ch = GETC())); s = ch;while (!isspace(ch = GETC())) s += ch;return *this;}
  Tp<class T> void read(T& x) { bool sign = 0;while ((ch = GETC()) < 48) sign ^= (ch == 45); x = (ch ^ 48);
    while ((ch = GETC()) > 47) x = (x << 1) + (x << 3) + (ch ^ 48); x = sign ? -x : x;
  }FILEIN& operator>>(int& x) { return read(x), *this; } FILEIN& operator>>(ll& x) { return read(x), *this; }
} in;
struct FILEOUT {const static int LIMIT = 1 << 22 ;char quq[SZ], ST[233];int sz, O;
  ~FILEOUT() { flush() ; }void flush() {fwrite(quq, 1, O, stdout); fflush(stdout);O = 0;}
  FILEOUT& operator<<(char c) {return quq[O++] = c, *this;}
  FILEOUT& operator<<(string str) {if (O > LIMIT) flush();for (char c : str) quq[O++] = c;return *this;}
  Tp<class T> void write(T x) {if (O > LIMIT) flush();if (x < 0) {quq[O++] = 45;x = -x;}
		do {ST[++sz] = x % 10 ^ 48;x /= 10;} while (x);while (sz) quq[O++] = ST[sz--];
  }FILEOUT& operator<<(int x) { return write(x), *this; } FILEOUT& operator<<(ll x) { return write(x), *this; }
} out;
//#define int long long

int n , m , len ;
const int maxn = 1e5 + 51 ;
const int maxm = 2e6 + 62 ;
vector < pii > g[maxn] ;
int L[maxn] , R[maxn] , rev[maxn] , idx = 0 , dep[maxn] , tmp[maxn] ;

void dfs(int u) {
	rev[L[u] = ++ idx] = u ;
	for(auto x : g[u]) dep[x.first] = dep[u] + x.second , dfs(x.first) ;
	R[u] = idx ;
}

const int maxB = 123 ;
int bl[maxn] , S , st[maxB] , ed[maxB] , mn[maxB] , c[maxB] , s[maxB][maxm] ;

signed main() {
  // code begin.
	in >> n >> m >> len ; S = sqrt(n) ;
	if((n - 1) / S + 1 > 120) S = n / 120 ;
	rep(i , 2 , n) { int u , w ;	in >> u >> w , g[u].pb(i , w) ; }
	dfs(1) ; rep(i , 1 , n) tmp[i] = dep[i] ;	rep(i , 1 , n) dep[i] = tmp[rev[i]] ;
	rep(i , 1 , n) bl[i] = (i - 1) / S + 1 ; st[1] = 1 , ed[1] = S ;
	int all = bl[n] ; rep(i , 2 , all) st[i] = ed[i - 1] + 1 , ed[i] = ed[i - 1] + S ; ed[all] = n ;
	rep(i , 1 , all) mn[i] = 1 << 30 ; rep(i , 1 , n) cmin(mn[bl[i]] , dep[i]) ; 
	rep(i , 1 , n) cmax(c[bl[i]] , dep[i] -= mn[bl[i]]) , ++ s[bl[i]][dep[i]] ;
	rep(i , 1 , all) rep(j , 1 , c[i]) s[i][j] += s[i][j - 1] ;
	while(m --) {
		int op , x , k ; in >> op >> x >> k ;
		const int le = L[x] , ri = R[x] , p = bl[le] , q = bl[ri] ;
		if(op == 1) {
			if(ri - le + 1 < k) { out << -1 << '
' ; continue ; }
			int l = 0 , r = maxm , ans = 0 ;
			while(l <= r) {
				int mid = l + r >> 1 , sum = 0 ;
				if(p == q) rep(i , le , ri) sum += dep[i] + mn[p] <= mid ;
				else {
					rep(i , le , ed[p]) sum += dep[i] + mn[p] <= mid ; 
					rep(i , st[q] , ri) sum += dep[i] + mn[q] <= mid ;
					rep(i , p + 1 , q - 1) if(mid >= mn[i]) sum += s[i][min(mid - mn[i] , c[i])] ;
				}
				if(sum >= k) r = (ans = mid) - 1 ; else l = mid + 1 ;
			}
			out << ans << '
' ;
		}
		else {
			if(p == q) rep(i , le , ri) {
				if(dep[i] + k > c[p]) {
					rep(j , c[p] + 1 , dep[i] + k) s[p][j] = s[p][c[p]] ;
					c[p] = dep[i] + k ;
				}
				rep(j , dep[i] , dep[i] + k - 1) -- s[p][j] ;
				dep[i] += k ;
			}
			else {
				rep(i , p + 1 , q - 1) mn[i] += k ;
				rep(i , le , ed[p]) {
					if(dep[i] + k > c[p]) {
						rep(j , c[p] + 1 , dep[i] + k) s[p][j] = s[p][c[p]] ;
						c[p] = dep[i] + k ;
					}
					rep(j , dep[i] , dep[i] + k - 1) -- s[p][j] ;
					dep[i] += k ;
				}
				rep(i , st[q] , ri) {
					if(dep[i] + k > c[q]) {
						rep(j , c[q] + 1 , dep[i] + k) s[q][j] = s[q][c[q]] ;
						c[q] = dep[i] + k ;
					}
					rep(j , dep[i] , dep[i] + k - 1) -- s[q][j] ;
					dep[i] += k ;
				}
			}
		}
	}
	return 0;
  // code end.
}