제출 #1238229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238229		Timosh	통행료 (IOI18_highway)	C++20	0 / 100	491 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);
  vector<int> p(M + 1);
  iota(p.begin(), p.end(), 0ll);
  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 bfs = [&](int node) -> void
  {
    queue<int> q;
    q.push(node);
    vector<int> vis(N);
    while (!q.empty())
    {
      int cur = q.front();
      q.pop();
      if (vis[cur])
        continue;
      for (auto &x : g[cur])
      {
        d[x] = d[cur] + 1;
        q.push(x);
      }
    }
  };
  bfs(0);
  int a = 0;
  int l = 0, r = M - 1;
  sort(p.begin(), p.end(), [&](int &i, int &j)
       { return max(d[U[i]], d[V[i]]) < max(d[U[j]], d[V[j]]); });
  while (l <= r)
  {
    int m = (l + r) / 2;
    for (int i = 0; i < M; i++)
      w[p[i]] = (i >= m);
    int x = ask(w);
    if (x == D)
      r = m - 1;
    else
      l = m + 1, a = p[m];
  }
  int b = (d[V[a]] > d[U[a]] ? V[a] : U[a]);
  d[b] = 0;
  a = l = 0, r = M - 1;
  bfs(b);
  sort(p.begin(), p.end(), [&](int &i, int &j)
       { return max(d[U[i]], d[V[i]]) < max(d[U[j]], d[V[j]]); });
  while (l <= r)
  {
    int m = (l + r) / 2;
    for (int i = 0; i < M; i++)
      w[p[i]] = (i >= m);
    int x = ask(w);
    if (x == D)
      r = m - 1;
    else
      l = m + 1, a = p[m];
  }
  int c = (d[V[a]] > d[U[a]] ? V[a] : U[a]);
  answer(c, b);
}

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