#include <bits/stdc++.h>
#include "migrations.h"
using namespace std;
vector<int> g[10001];
vector<int> d;
vector<bool> vis;
void dfs(int u) {
vis[u] = 1;
for (auto v : g[u]) {
if (!vis[v]) {
d[v] = d[u] + 1;
dfs(v);
}
}
}
pair<int, int> get(int N) {
d.assign(N, 0);
vis.assign(N, false);
dfs(0);
int u = d.size() - 1 - (max_element(d.rbegin(), d.rend()) - d.rbegin());
return {0, u};
}
int x = 0;
int send_message(int N, int i, int Pi) {
g[i].push_back(Pi);
g[Pi].push_back(i);
if (i == N - 1) {
auto [_, u] = get(N);
return u - x;
}
if (N - i <= 50) {
auto [_, u] = get(N);
cerr << u - x << '\n';
if (u - x >= 202) {
x += 202;
return 101;
} else if (u - x >= 100) {
x += 100;
return 100;
}else {
int ret = u - x;
x = u;
return ret;
}
}
return 0;
}
pair<int, int> longest_path(vector<int> S) {
int N = S.size();
int sum = accumulate(S.begin(), S.end(), 0);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 101) {
sum += S[i];
}
}
return {0, sum};
}
