Submission #1287319

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287319		kawhiet	Migrations (IOI25_migrations)	C++20	0 / 100	37 ms	1184 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());
  return {0, u};
}

int x = 0;

int send_message(int N, int i, int Pi) {
  g[i].push_back(Pi);
  g[Pi].push_back(i);
  if (N - i <= 50) {
    auto [_, u] = get(N);
    if (u - x > 202) {
      x += 202;
      return 101;
    } else {
      int ret = u - x;
      x = u;
      return ret;
    }
  }
  return 0;
}

pair<int, int> longest_path(vector<int> S) {
  int N = S.size();
  int sum = accumulate(S.begin(), S.end(), 0);
  for (auto k : S) {
    if (k == 101) {
      sum += k;
    }
  }
  return {0, sum};
}

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