Company Queries II

#include <iostream>
#include <vector>
#include <algorithm>


struct Element {
    int boss;
    int level;
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int n, q;
    std::cin >> n >> q;
    std::vector<Element> elements(n + 1);
    elements[1] = Element{1, 1};
    for (int i = 2; i <= n; i++) {
        std::cin >> elements[i].boss;
        elements[i].level = elements[elements[i].boss].level + 1;
    }
    std::vector<std::pair<int, int>> queries(q);
    for (int j = 0; j<q; j++) {
        std::cin >> queries[j].first >> queries[j].second;
    }
    for (int j = 0; j<q; j++) {
        Element a = elements[queries[j].first];
        Element b = elements[queries[j].second];
        while (a.level != b.level) {
            if (a.level < b.level) a = elements[a.boss];
            else b = elements[b.boss];
        }
        while (a.boss != b.boss) {
            if (a.boss > 1) a = elements[a.boss];
            if (b.boss > 1) b = elements[b.boss];
        }
        std::cout << a.boss << std::endl;
    }
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED