Company Queries II

#include <bits/stdc++.h>
using namespace std;

vector<int> c[(int)2e5+1];
int par[(int)2e5+1];
vector<bool> vis((int)2e5+1);
stack<int> s;
vector<int> sn;
vector<int> depth((int)2e5+1);
vector<int> fo((int)2e5+1);
map<pair<int,int>,pair<int, int>> mrq;

int main() {
	par[1] = 0;
	int n, q;
	cin >> n >> q;
	for (int i=2; i<=n; i++) {
		int b;
		cin >> b;
		par[i] = b;
		c[b].push_back(i);
	}
	s.push(1);
	while (!s.empty()) {
		int b = s.top(); s.pop();
		fo[b] = sn.size();
		sn.push_back(b);
		if (vis[b]) continue;
		vis[b] = true;
		for (int ch : c[b]) {
			s.push(b);
			s.push(ch);
		}
	}
	int nn = 1;
	int sns = sn.size();
	while (nn <= sns) {
		nn -= 1;
		for (int i=0; i<sns-nn; i++) {
			if (nn == 0) {
				mrq[{i,i}] = {depth[sn[i]], sn[i]};
				continue;
			}
			mrq[{i, i+nn}] = min(mrq[{i, i+nn/2}], mrq[{i+nn-nn/2, i+nn}]);
		}
		nn = (nn+1) * 2;
	}

	for (int i=0; i<q; i++) {
		int a, b;
		cin >> a >> b;
		a = fo[a];
		b = fo[b];
		int mn = min(a, b);
		int mx = max(a, b);
		int nn = 1;
		for (; nn*2 < (mx-mn)+1; nn*=2);
		int out = min(mrq[{mn, mn+nn-1}], mrq[{mx-nn+1, mx}]).second;
		cout << out << "\n";
	}

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED