#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int P[10000];
vector<int> g[10000];
int dist[10000] = {0};
void dfs(int u, int p = -1)
{
if (p == -1) dist[u] = 0;
for (int v : g[u]) if (v != p) {
dist[v] = dist[u] + 1;
dfs(v, u);
}
}
int prev_a, prev_b;
int a, b;
void find_diameter()
{
prev_a = a;
prev_b = b;
a = b = 0;
dfs(0);
for (int i = 0; i < n; i++)
if (dist[i] > dist[a])
a = i;
dfs(a);
for (int i = 0; i < n; i++)
if (dist[i] > dist[b])
b = i;
if (a > b) swap(a, b);
}
bool cancelled = false;
int send_message(int N, int i, int Pi)
{
n = N;
g[i].push_back(Pi);
g[Pi].push_back(i);
if (N - 40 <= i && i < N - 26) {
find_diameter();
return (a >> (2 * (i - (N - 40)))) & 0b11;
}
if (N - 26 <= i && i < N - 12) {
find_diameter();
return (b >> (2 * (i - (N - 26)))) & 0b11;
}
if (N - 12 <= i && i < N - 6) {
find_diameter();
if (a == i)
return 3;
if (b == i)
return 4;
if (N - 40 <= a && a < N - 12)
return ((N - a) >> (i - (N - 12))) & 1;
return 0;
}
if (N - 6 <= i) {
find_diameter();
if (a == i)
return 3;
if (b == i)
return 4;
if (N - 40 <= b && b < N - 12)
return ((N - b) >> (i - (N - 6))) & 1;
return 0;
}
return 0;
}
pair<int, int> longest_path(vector<int> S)
{
int N = S.size();
int a = 0, b = 0;
for (int i = N - 40; i < N - 26; i++)
a |= S[i] << (2 * (i - (N - 40)));
for (int i = N - 26; i < N - 12; i++)
b |= S[i] << (2 * (i - (N - 26)));
int offset_a = 0, offset_b = 0;
for (int i = N - 12; i < N - 6; i++)
offset_a |= S[i] << (i - (N - 12));
for (int i = N - 6; i < N; i++)
offset_b |= S[i] << (i - (N - 6));
if (offset_a)
a = N - offset_a;
if (offset_b)
b = N - offset_b;
for (int i = N - 12; i < N; i++) {
if (S[i] == 3)
a = i;
if (S[i] == 4)
b = i;
}
return {a, b};
}
