#include <bits/stdc++.h> constexpr int LM = 9998, RM = 20000; int lm = LM, rm = RM; int send_message(int N, int i, int Pi) { if (lm % 2 == 0) { return lm--; } else { return rm--; } } std::pair<int, int> longest_path(std::vector<int> S) { return std::make_pair(LM, RM); }