# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1255105 | vpinx | Migrations (IOI25_migrations) | C++20 | 0 ms | 0 KiB |
#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> dist(n);
int ans = 0;
int send_message(int n, int i, int pi) {
if (i == 1) dist[0] = 0, dist[1] = 1;
else dist[i] = dist[pi] + 1;
ans = max(ans, dist[i]);
if (dist[i] < ans) return 0;
return 1;
}
pair<int, int> longest_path(vector<int> s) {
int u = 0, v;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 1) v = i + 1;
}
return {u, v};
}