Company Queries II

input/code.cpp: In function 'Node* lca(Node*, int, int)':
input/code.cpp:58:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (i = 0; i < path1.size() && i < path2.size(); i++)
      |                 ~~^~~~~~~~~~~~~~
input/code.cpp:58:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (i = 0; i < path1.size() && i < path2.size(); i++)
      |                                     ~~^~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;
#define ll long long

#define fastio()                  \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

class Node
{
public:
    int data;
    Node *left, *right;
    Node(int x)
    {
        data = x;
        left = nullptr;
        right = nullptr;
    }
};

// Function to find path from root to given node.
bool findPath(Node *root, vector<Node *> &path, int n)
{

    if (root == nullptr)
        return false;

    // Store current node value in the path.
    path.push_back(root);

    if (root->data == n ||
        findPath(root->left, path, n) ||
        findPath(root->right, path, n))
        return true;

    // else remove root from path and return false
    path.pop_back();
    return false;
}

Node *lca(Node *root, int n1, int n2)
{

    vector<Node *> path1, path2;

    // Find paths from root to n1
    // and root to n2.
    if (!findPath(root, path1, n1) ||
        !findPath(root, path2, n2))
        return nullptr;

    // Compare the paths to get the first
    // different value
    int i;
    for (i = 0; i < path1.size() && i < path2.size(); i++)
    {
        if (path1[i] != path2[i])
            return path1[i - 1];
    }

    return path1[i - 1];
}

// g++ -std=c++17 -O2 -pipe -Wall -Wextra a.cpp -o a
int main()
{
    fastio();

    int n, q;
    cin >> n >> q;

    vector<int> e(n - 1);
    for (int i = 0; i < n - 1; i++)
    {
        cin >> e[i];
    }
    vector<Node *> nodes(n + 1);
    for (int i = 1; i <= n; i++)
    {
        nodes[i] = new Node(i);
    }
    for (int i = 2; i <= n; i++)
    {
        if (nodes[e[i - 2]]->left == nullptr)
            nodes[e[i - 2]]->left = nodes[i];
        else
            nodes[e[i - 2]]->right = nodes[i];
    }
    Node *root = nodes[1];
    while (q--)
    {
        int a, b;
        cin >> a >> b;
        cout << lca(root, a, b)->data << "\n";
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

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: RUNTIME ERROR

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED