Company Queries II

input/code.cpp: In function 'void dfs(int, int, std::vector<int>&)':
input/code.cpp:120:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; (1ll<<i)<tmp.size(); i++) {
      |                     ~~~~~~~~^~~~~~~~~~~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;


const int N=2e5+10;
vector<int> adj[N];
int up[N][40];

int tin[N], tout[N];
int t=0;


void dfs2(int node, int prev) {
    tin[node]=t++;

    for(auto &w:adj[node]) {
        if(w==prev) continue;
        dfs2(w, node);
    }

    tout[node]=t++;
}

void dfs(int node, int prev, vector<int> &tmp) {
    reverse(all(tmp));
    tmp.pb(node);
    reverse(all(tmp));

    
    //std::cout << node << ": ";
    //__print(tmp); std::cout  << std::endl;
    for (int i = 0; (1ll<<i)<tmp.size(); i++) {
        up[node][i]=tmp[(1ll<<i)];
        //std::cout << tmp[(1ll<<i)] << " ";
    }
    //std::cout  << std::endl;
    for(auto &w:adj[node]) {
        if(w==prev) continue;
        dfs(w, node, tmp);
    }

    reverse(all(tmp));
    tmp.pop_back();
    reverse(all(tmp));
}

bool isAncestor(int a, int b) {
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca(int a, int b) {
    if(isAncestor(a,b)) return a;
    if(isAncestor(b,a)) return b;
    
    for (int i = 35; i >= 0; i--) {
        if(up[a][i]!=-1 && !isAncestor(up[a][i], b)) {
            a=up[a][i];
        }
    }    

    return up[a][0];
}

int solve() {
    int n, q; std::cin >> n >> q;
    for (int i = 2; i <= n; i++) {
        int p; std::cin >> p;
        adj[p].pb(i);
        adj[i].pb(p);
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= 35; j++) {
            up[i][j]=-1;
        }
    }

 
    vector<int> tmp;
    dfs(1, -1, tmp);
    /*
   for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 3; j++) {
            std::cout << up[i][j] << " ";
        }
        std::cout  << std::endl;
    }

    */
    dfs2(1, -1);
    


    while(q--) {
        int a, b; std::cin >> a >> b;
        std::cout << lca(a,b) << std::endl;
    }



    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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