Submission #1237343

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237343		Timosh	Highway Tolls (IOI18_highway)	C++20	0 / 100	313 ms	327680 KiB

highway

#include "bits/stdc++.h"
#include "highway.h"

using namespace std;

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B)
{
  int M = U.size();
  vector<int> d(N), w(M);
  int D = ask(w);
  vector<vector<int>> g(N);
  for (int i = 0; i < M; i++)
  {
    g[U[i]].push_back(V[i]);
    g[V[i]].push_back(U[i]);
  }
  auto dfs = [&](auto dfs, int node, int par) -> void
  {
    for (auto &x : g[node])
    {
      if (x == par)
        continue;
      d[x] = d[node] + 1;
      dfs(dfs, x, node);
    }
  };
  dfs(dfs, 0, -1);
  int a = 0, b = 0;
  int l = 0, r = N;
  while (l <= r)
  {
    int m = (l + r) / 2;
  }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31