Submission #1261501

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261501		avighna	Migrations (IOI25_migrations)	C++20	10 / 100	29 ms	1220 KiB

migrations

#include <bits/stdc++.h>

std::vector<std::vector<int>> adj;

int send_message(int N, int i, int Pi) {
  if (adj.empty()) {
    adj.resize(N);
  }
  adj[i].push_back(Pi);
  adj[Pi].push_back(i);
  if (i == N - 1) {
    std::vector<int> d(N);
    auto dfs = [&](auto &&self, int u, int p) -> void {
      for (int &i : adj[u]) {
        if (i != p) {
          d[i] = d[u] + 1;
          self(self, i, u);
        }
      }
    };
    dfs(dfs, 0, -1);
    int it = std::max_element(d.begin(), d.end()) - d.begin() + 1;
    return it;
  } else {
    return 0;
  }
}

std::pair<int, int> longest_path(std::vector<int> S) {
  adj.clear();
  return {0, S.back() - 1};
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 30
• Subtask 2: 0 / 70