#include "migrations.h" #include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back int timer=0; int dst[30000]; pair<int,int>p={0,0}; int send_message(int N, int i, int Pi) { dst[i]=dst[Pi]+1; if(timer==0)p={0,0}; timer++; if(timer==N-1){ for(int i=0;i<N;i++){ p=max(p,{dst[i],i}); } return p.ss; } return 0; } std::pair<int, int> longest_path(std::vector<int> S) { return {0, S[0]}; }