Submission #1327015

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327015		riafhasan2010	악어의 지하 도시 (IOI11_crocodile)	C++17	0 / 100	0 ms	336 KiB

crocodile

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

const ll inf = 1e17;

int travel_plan(int n, int m, int R[][2], int L[], int k, int p[]) {
  vector<pair<int, int>> g[n];
  for (int i = 0; i < m; i++) {
    g[R[i][0]].push_back({R[i][1], L[i]});
    g[R[i][1]].push_back({R[i][0], L[i]});
  }
  vector<ll> best(n, inf), second_best(n, inf);
  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
  for (int i = 0; i < k; i++) {
    best[p[i]] = 0;
    pq.push({0, p[i]});
  }
  while (!pq.empty()) {
    auto [c, u] = pq.top(); pq.pop();
    if (c > second_best[u]) continue;
    for (auto [v, w] : g[u]) {
      if (c + w < best[v]) {
        second_best[v] = best[v];
        best[v] = c + w;
        pq.push({best[v], v});
      }
      else if (c + w < second_best[v]) {
        second_best[v] = c + w;
        pq.push({c + w, v});
      }
    }
  }
  return second_best[0];
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11