/* Problem URL: https://codeforces.com/gym/105900/problem/G */ #include using namespace std; #define V vector #define rmin(a, b) a = min(a, b) #define rmax(a, b) a = max(a, b) #define rep(i, lim) for (int i = 0; i < (lim); i++) #define nrep(i, s, lim) for (int i = s; i < (lim); i++) #define repv(i, v) for (auto &i : (v)) #define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; } #define sortv(v) sort(v.begin(), v.end()) #define all(v) (v).begin(), (v).end() using vi = vector; using vvi = vector; using vvvi = vector; using vvvvi = vector; using ll = long long; using vl = vector; using vvl = vector; using vvvl = vector; using vvvvl = vector; template auto operator<<(ostream &os, const vector &vec)->ostream& { os << vec[0]; for (size_t i = 1; i < vec.size(); i++) { os << ' ' << vec[i]; } os << '\n'; return os; } template auto operator>>(istream &is, vector &vec)->istream& { for (auto &i : vec) { is >> i; } return is; } template auto operator<<(ostream &os, const vector> &vec)->ostream& { for (auto &i : vec) { os << i[0]; for (size_t j = 1; j < i.size(); j++) { os << ' ' << i[j]; } os << '\n'; } return os; } template auto operator>>(istream &is, vector> &vec)->istream& { for (auto &i : vec) { for (auto &j : i) { is >> j; } } return is; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vi fds(n); repv(i, fds) { cin >> i; i--; } vvi dp(n, vi(2, -1)); int ans = 0; V frame(n); V vis(n); vi dis(n, 0); V loop(n); function(int)> dfs = [&](int i) { vis[i] = true; if (frame[fds[i]]) { int size = dis[i] - dis[fds[i]]; dp[i][0] = size / 2; dp[i][1] = size / 2; loop[i] = true; return make_pair(fds[i], size); } frame[i] = true; dis[fds[i]] = dis[i] + 1; auto [cat, size] = dfs(fds[i]); frame[i] = false; if (cat != -1) { loop[i] = true; dp[i][0] = ans / 2; dp[i][1] = ans / 2; if (cat == i) { return make_pair(-1, -1); } return make_pair(cat, size); } return make_pair(-1, -1); }; rep(i, n) { if (vis[i]) { continue; } dfs(i); } function calc = [&](int i) { if (dp[i][0] != -1) { return; } dp[i][0] = dp[fds[i]][1]; dp[i][1] = dp[fds[i]][0] + 1; }; rep(i, n) { } cout << dp; cout << ans << '\n'; }