제출 #364713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
364713		WLZ	악어의 지하 도시 (IOI11_crocodile)	C++14	89 / 100	626 ms	63332 KiB

crocodile

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

const int INF = 0x3f3f3f3f;

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

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