#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair < ll, ll >;
const ll INF = 1e18;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
ll i, x, c, y, s, p, X;
vector < pair < ll,ll > > adj[N + 2];
for (i = 0; i < M; i ++) {
x = R[i][0];
y = R[i][1];
adj[x].push_back({y, L[i]});
adj[y].push_back({x, L[i]});
}
priority_queue < pll, vector < pll > , greater < pll > > pq;
ll D[N + 2][2];
for (i = 0; i < N; i ++) D[i][1] = INF, D[i][0] = INF;
for (i = 0; i < K; i ++) {
pq.push({0, P[i]});
D[P[i]] = {0, 0};
}
while(!pq.empty()) {
x = pq.top().second;
c = pq.top().first;
pq.pop();
if ( D[x][1] != c) continue;
for ( pair < ll, ll > & pa : adj[x]) {
X = pa.first;
s = c + pa.second;
p = D[X][1];
if ( s < D[X][0]) {
if ( D[X][0] < INF && D[X][1] != D[X][0]) {
D[X][1]= D[X][0];
pq.push({D[X][1], X});
}
D[X][0] = s;
}
else {
if ( s < D[x][1]) {
D[X][1] = s;
pq.push({D[X][1], X});
}
}
}
}
return D[0][1];
}
Compilation message
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:21:11: error: assigning to an array from an initializer list
21 | D[P[i]] = {0, 0};
| ~~~~~~~~^~~~~~~~
