| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346016 | Jer | Migrations (IOI25_migrations) | C++20 | 0 ms | 360 KiB |
#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10005;
int depth[MAXN], best_depth = -1, best = 0;
int send_message(int n, int i, int p)
{
if (i != 0)
depth[i] = depth[p] + 1;
if (depth[i] > best_depth)
best = i, best_depth = depth[i];
if (i == n - 1)
return best;
}
std::pair<int, int> longest_path(std::vector<int> s)
{
return {0, s[s.size() - 1]};
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
