Submission #1063337

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063337		vjudge1	Factories (JOI14_factories)	C++17	15 / 100	8058 ms	72624 KiB

factories

#include "factories.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

void dijkstra();

ll inf = LONG_LONG_MAX;
int n;
vector<vector<pair<int, ll>>> adj(500005);
vector<bool> vis(500005, 0);
vector<ll> dis(500005, inf);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;

void Init(int N, int A[], int B[], int D[])
{
  n = N;
  for (int i = 0; i < N - 1; i++)
  {
    adj[A[i]].pb({B[i], D[i]});
    adj[B[i]].pb({A[i], D[i]});
  }
}

long long Query(int S, int X[], int T, int Y[])
{
  for (int i = 0; i < n; i++)
  {
    vis[i] = 0;
    dis[i] = inf;
  }
  for (int i = 0; i < T; i++)
  {
    dis[Y[i]] = 0;
    pq.push({0, Y[i]});
  }

  dijkstra();

  ll ans = inf;
  for (int i = 0; i < S; i++)
  {
    ans = min(ans, dis[X[i]]);
  }

  return ans;
}

void dijkstra()
{
  while (!pq.empty())
  {
    int a = pq.top().second;
    pq.pop();

    if (vis[a])
      continue;
    vis[a] = 1;

    for (auto [b, w] : adj[a])
    {
      if (dis[b] > dis[a] + w)
      {
        dis[b] = dis[a] + w;
        pq.push({dis[b], b});
      }
    }
  }
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 18
• Subtask 3: 0 / 67