Company Queries II

#include <bits/stdc++.h>

using namespace std;

//Definitions for quicker writing
#define REP(i,a,b) for (int i = a; i < b; i++)
#define PB push_back
#define MP make_pair
#define F first
#define S second

//Typedefs for quicker writing
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int,int> pi;
typedef pair<long long, long long> pl;

//Max values
const long long lmx = LLONG_MAX;
const int imx = INT_MAX;

int main() {
	//IO optimization
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	//Input definition
	int n;
	int q;

	//Read In
	cin >> n >> q;

	int boss[n];
	int level[n];
	boss[0] = 1;
	level[0] = 0;
	REP(i,1,n){
	       	cin >> boss[i];
		level[i] = level[boss[i]-1] + 1;
	}

	pi queries[q];
	REP(i,0,q){
	       	cin >> queries[i].first;
		cin >> queries[i].second;
	}
	
	//Main part
	int ans[q];
	int emp1, emp2;
	int lvl1, lvl2;
	REP(i,0,q){
		emp1 = queries[i].first;
		lvl1 = level[emp1-1];
		emp2 = queries[i].second;	
		lvl2 = level[emp2-1];
		if(lvl1 < lvl2){
			REP(j,0,lvl2-lvl1){
				emp2 = boss[emp2-1];
				//cout << "l2: " << level[emp2]-1 << "\n";
			}
		}
		if(lvl2 < lvl1){
			REP(j,0,lvl1-lvl2){
				emp1 = boss[emp1-1];
				//cout << "l1: " << level[emp1]-1 << "\n";
			}
		}
		while(emp1 != emp2){
			emp1 = boss[emp1-1];
			emp2 = boss[emp2-1];
		}
		ans[i] = emp1;
	}

	//Write out
	REP(i,0,q) cout << ans[i] << "\n";
		
	//Return
	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: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED