Submission #1130987

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130987		eshaanagg	Race (IOI11_race)	C++20	0 / 100	0 ms	320 KiB

race

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

void updateWithMin(map<int, int> &a, int k, int v)
{
  if (a.find(k) == a.end())
    a[k] = v;
  else
    a[k] = min(a[k], v);
}

int get(map<int, int> &a, int k)
{
  return a.find(k) == a.end() ? 1e9 : a[k];
}

void merge(map<int, int> &a, map<int, int> &b, int l, int tar)
{
  if (a.size() < b.size())
    swap(a, b);

  for (auto [nk, v] : b)
  {
    int k = nk - l;

    // Find for a complementary end point
    if (a.find(tar - k) != a.end())
    {
      int other = get(a, tar - k);
      updateWithMin(a, 0, v + 1 + other);
    }

    // Set the current end point
    updateWithMin(a, k, v + 1);
  }
}

int best_path(int n, int k, int edges[][2], int wt[])
{
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < n - 1; i++)
  {
    int u = edges[i][0], v = edges[i][1], w = wt[i];
    g[u].push_back({v, w});
    g[v].push_back({u, w});
  }

  vector<map<int, int>> paths(n);
  for (int i = 0; i < n; i++)
    paths[i][k] = 0;

  int minPaths = n + 1;

  function<void(int, int)> dfs = [&](int u, int p)
  {
    for (auto [v, w] : g[u])
    {
      if (v == p)
        continue;
      dfs(v, u);
      merge(paths[u], paths[v], w, k);
    }

    if (paths[u].find(0) != paths[u].end())
      minPaths = min(minPaths, paths[u][0]);
  };

  dfs(0, -1);
  return minPaths == n + 1 ? -1 : minPaths;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57