| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1302736 | alexrana2626 | Migrations (IOI25_migrations) | C++20 | 0 ms | 0 KiB |
#include "migrations.h"
#include <bits/stdc++.h>
int a[100001], id, mx = -1;
int send_message(int N, int i, int Pi)
{
a[i] = a[Pi] + 1;
if (a[i] > mx)
{
mx = a[i];
id = i;
}
if (i == N - 1) return id;
}
pair<int, int> longest_path(vector<int> S)
{
return {0, S.back()};
}
