제출 #116603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116603		dragonslayerit	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	1356 ms	77564 KiB

crocodile

#include "crocodile.h"
#include <vector>
#include <queue>
#include <stdint.h>

static std::vector<std::pair<int,int> > adj[100005];
static int vis[100005];
static int64_t dist[100005];


int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  for(int i=0;i<M;i++){
    adj[R[i][0]].push_back({R[i][1],L[i]});
    adj[R[i][1]].push_back({R[i][0],L[i]});
  }
  std::priority_queue<std::pair<int64_t,int> > pq;
  for(int i=0;i<K;i++){
    pq.push({0,P[i]});
    pq.push({0,P[i]});
  }
  while(!pq.empty()){
    int64_t d=-pq.top().first;
    int node=pq.top().second;
    pq.pop();
    if(++vis[node]!=2) continue;
    dist[node]=d;
    for(auto e:adj[node]){
      int child=e.first;
      pq.push({-dist[node]-e.second,child});
    }
  }
  return dist[0];
}

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