#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
#define INF 1e18
ll travel_plan(int N, int M, int R[][2], ll L[], int K, int P[]){
int n = N, m = M, k = K;
vector<vector<pair<int, ll>>> graph(n);
for (int i = 0; i < m; i++){
graph[R[i][0]].push_back({R[i][1], L[i]});
graph[R[i][1]].push_back({R[i][0], L[i]});
}
ll dist[n][2];
for (int i = 0; i < n; i++){
dist[i][0] = INF, dist[i][1] = INF;
}
priority_queue<pair<ll, pair<int, int>>, vector<pair<ll, pair<int, int>>>, greater<pair<ll, pair<int, int>>>> pq;
for (int i = 0; i < k; i++){
dist[P[i]][0] = 0;
dist[P[i]][1] = 0;
pq.push({0, {P[i], 1}});
}
while (!pq.empty()){
ll cur_dis = pq.top().first;
int u = pq.top().second.first, type = pq.top().second.second;
pq.pop();
if (cur_dis != dist[u][type]){
continue;
}
for (pair<int, int> p: graph[u]){
int v = p.first, w = p.second;
if (dist[v][0] > w + cur_dis){
dist[v][1] = dist[v][0];
dist[v][0] = w+cur_dis;
pq.push({dist[v][1], {v, 1}});
}else if (dist[v][1] > w + cur_dis){
dist[v][1] = w + cur_dis;
pq.push({dist[v][1], {v, 1}});
}
}
}
return dist[0][1];
}
Compilation message
/usr/bin/ld: /tmp/cc2T7TYk.o: in function `main':
grader.cpp:(.text.startup+0x36): undefined reference to `travel_plan(int, int, int (*) [2], int*, int, int*)'
collect2: error: ld returned 1 exit status
