#include "migrations.h" int a[100001], ans, s; int send_message(int N, int i, int Pi) { if (i == 1) { a[0] = 0; s = 0; ans = 0; } a[i] = a[Pi] + 1; if (a[i] > ans) { s = i; ans = a[i]; } if (i == N-1) { return s + 1; } else return 0; } std::pair<int, int> longest_path(std::vector<int> S) { int sz = S.size(),k; for (int i = 1; i < sz; i++) { if (S[i] != 0) { k = S[i]; } } return {0,k-1}; }