Company Queries II

input/code.cpp: In member function 'int TreeAncestor::getKthAncestor(int, int)':
input/code.cpp:30:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for (int j = 0; j < up[0].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <cmath>
 
using namespace std;
 
class TreeAncestor {
public:
    int n;
    vector<vector<int>> up;
 
    TreeAncestor(int n, vector<int>& parent) : n(n) {
        int maxLog = log2(n) + 1;
        up.assign(n, vector<int>(maxLog, -1));
 
        for (int i = 0; i < n; i++) {
            up[i][0] = parent[i];
        }
 
        for (int j = 1; j < maxLog; j++) {
            for (int i = 0; i < n; i++) {
                if (up[i][j - 1] != -1) {
                    up[i][j] = up[up[i][j - 1]][j - 1];
                }
            }
        }
    }
 
    int getKthAncestor(int node, int k) {
        for (int j = 0; j < up[0].size(); j++) {
            if (k & (1 << j)) {
                node = up[node][j];
                if (node == -1) return -1;
            }
        }
        return node;
    }
};
 
int main() {
    int n,q; // Número de nodos en el árbol (1-indexado, pero usamos 0-indexado en el código)
 
    cin >> n >> q;
 
 
    
    // El nodo 0 es una raíz ficticia, y los nodos 1-8 tienen la estructura según el ejemplo
    vector<int> parent(n,-1);
    for(int i=1; i<n; i++){
        int temp;
        cin >> temp;
        parent[i] = temp-1;
    }
 
    TreeAncestor treeAncestor(n, parent);
 
    for(int i=0; i<q; i++){
        int a,b;
        cin >> a >> b;
        a -=1;
        b -=1;
 
        vector<bool> jefe(n,false);
        int count=1;
        int comm;
        if(a==0 or b==0){
            cout << 1 << endl;
            continue;
        }
        while(true){
            int jef1 = treeAncestor.getKthAncestor(a, count);
            int jef2 = treeAncestor.getKthAncestor(b, count);
            if(jefe[jef1]){
                comm = jef1+1;
                break;
            }
            else jefe[jef1]=true;
            if(jefe[jef2]){
                comm = jef2+1;
                break;
            }
            else jefe[jef2]=true;
        }
        cout << comm <<endl;
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER