Submission #1287253

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287253		kawhiet	Migrations (IOI25_migrations)	C++20	10 / 100	31 ms	1236 KiB

migrations

#include <bits/stdc++.h>
#include "migrations.h"
using namespace std;

vector<int> g[10001];
vector<int> d;
vector<bool> vis;

void dfs(int u) {
  vis[u] = 1;
  for (auto v : g[u]) {
    if (!vis[v]) {
      d[v] = d[u] + 1;
      dfs(v);
    }
  }
}

pair<int, int> get(int N) {
  d.assign(N, 0);
  vis.assign(N, false);
  dfs(0);
  int u = d.size() - 1 - (max_element(d.rbegin(), d.rend()) - d.rbegin());
  // d.assign(N, 0);
  // vis.assign(N, false);
  // dfs(u);
  // int v = d.size() - 1 - (max_element(d.rbegin(), d.rend()) - d.rbegin());
  return {0, u};
}

int prv;

int send_message(int N, int i, int Pi) {
  g[i].push_back(Pi);
  g[Pi].push_back(i);
  if (i == N - 2) {
    auto [u, v] = get(N);
    prv = v;
    return v;
  } else if (i == N - 1) {
    auto [_, v] = get(N);
    return (prv == v ? 0 : v - prv);
    // auto [u, v] = get(N);
    // if (u != 0) return (d == u ? 0 : u - d);
    // else return (d == v ? 0 : v - d);
  }
  return 0;
}

pair<int, int> longest_path(vector<int> S) {
  int N = S.size();
  return {0, S[N - 1] + S[N - 2]};
}

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