Submission #364719

#	Time	Username	Problem	Language	Result	Execution time	Memory
364719		WLZ	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	696 ms	73008 KiB

crocodile

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

const long long INF = (long long) 1e18;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
  vector< vector< pair<int, long long> > > 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<long long> dist1(N, INF), dist2(N, INF);
  for (int i = 0; i < K; i++) dist1[P[i]] = dist2[P[i]] = 0;
  priority_queue< pair<long long, int>, vector< pair<long long, int> >, greater< pair<long long, int> > > pq;
  for (int i = 0; i < K; i++) pq.push({0, P[i]});
  while (!pq.empty()) {
    int u = pq.top().second;
    long long d = pq.top().first; pq.pop();
    if (d > dist2[u]) continue;
    for (auto& v : g[u]) {
      long long prev = dist2[v.first];
      if (d + v.second < dist1[v.first]) {
        dist2[v.first] = dist1[v.first];
        dist1[v.first] = d + v.second;
      } else if (d + v.second < dist2[v.first]) {
        dist2[v.first] = d + v.second;
      }
      if (dist2[v.first] != prev) pq.push({dist2[v.first], v.first});
    }
  }
  return dist2[0];
}

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