Company Queries II

#include <iostream>
#include <vector>
#include <climits>
using std::cout;
using std::endl;
#define DEBUG std::cout<<"LINE"<<__LINE__;
#define IN(A) int A;std::cin>>A;
#define BUG(A,B) std::cout<<A<<B<<std::endl;

using namespace std;

struct compute {
   vector<vector<int>> tree;
   vector<int> parents;
   vector<int> depth;
  void start(){

      IN(n);
      IN(q);

      tree.assign(n,vector<int>{});

      parents.assign(n,{});
      depth.assign(n,{});
   
   for (int i=1;i<n;i++) {
      IN(temp);
      tree[temp-1].emplace_back(i);
      parents[i]=temp-1;
   }

     bfs(0,0);
     for (int i=0;i<q;i++) {
        IN(a);
        IN(b);
         a=a-1;
        b=b-1;
        while (depth[a]<depth[b]) {
           b=parents[b];
        }

        while (depth[b]<depth[a]) {
           a=parents[a];
        }
        while (a!=b) {
           a=parents[a];
           b=parents[b];
        }
        cout<<a+1<<endl;
     }
  }



  void bfs(int node,int d) {
     depth[node]=d;
     for (auto child:tree[node]) {
        bfs(child,d+1);
     }

  }
};

int main() {

   compute comp;
   comp.start();




   return true;

}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: TIME LIMIT EXCEEDED