#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less_equal<long long>,
rb_tree_tag, tree_order_statistics_node_update> Tree;
const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 1e9 + 7; //[998244353, 1e9 + 7, 1e9 + 13]
const ld PI = acos(-1);
const ll NROOT = 500;
bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}
ll invmod(ll a) {return binpow(a, MOD - 2);}
int n, m, k;
vector<int> spec;
vector<vector<pair<int, ll>>> g;
bool cmp(pair<int, ll> a, pair<int, ll> b) {
if (a.S == b.S)
return a.F < b.F;
return a.S < b.S;
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
n = N;
m = M;
g.resize(n + 1);
for (int i = 0; i < m; i ++) {
int a = R[i][0] + 1;
int b = R[i][1] + 1;
int c = L[i];
g[a].push_back({b, c});
g[b].push_back({a, c});
}
k = K;
for (int i = 0; i < k; i ++)
spec.push_back(P[i] + 1);
vector<int> dis1(n + 1, inf);
using T = pair<ll, int>;
priority_queue<T, vector<T>, greater<T>> q;
for (auto &x : g)
stable_sort(x.begin(), x.end(), cmp);
for (auto &x : spec)
q.push({0, x});
while (!q.empty()) {
auto [d, x] = q.top();
q.pop();
if (dis1[x] <= d)
continue;
dis1[x] = d;
for (auto &y : g[x])
q.push({d + y.S, y.F});
}
vector<int> dis2(n + 1, inf);
q.push({0, 1});
while (!q.empty()) {
auto [d, x] = q.top();
q.pop();
if (dis2[x] <= d)
continue;
dis2[x] = d;
vector<pair<pair<ll, ll>, pair<int, ll>>> ways;
for (auto &y : g[x])
ways.push_back({{dis1[y.F], y.S}, y});
stable_sort(ways.begin(), ways.end());
for (int i = 1; i < ways.size(); i ++) {
pair<int, ll> y = ways[i].S;
q.push({d + y.S, y.F});
}
}
int ans = inf;
for (auto &x : spec)
ans = min(ans, dis2[x]);
if (ans == inf)
exit(1);
return ans;
}
#ifdef LOCAL
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N, M, K;
cin >> N >> M >> K;
int R[M][2], L[M], P[K];
for (int i = 0; i < M; i ++)
cin >> R[i][0] >> R[i][1] >> L[i];
for (int i = 0; i < K; i ++)
cin >> P[i];
cout << travel_plan(N, M, R, L, K, P) << "\n";
return 0;
}
#endif
Compilation message
crocodile.cpp: In function 'long long int invmod(long long int)':
crocodile.cpp:31:25: error: 'binpow' was not declared in this scope
31 | ll invmod(ll a) {return binpow(a, MOD - 2);}
| ^~~~~~
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:72:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
72 | auto [d, x] = q.top();
| ^
crocodile.cpp:88:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
88 | auto [d, x] = q.top();
| ^
crocodile.cpp:101:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | for (int i = 1; i < ways.size(); i ++) {
| ~~^~~~~~~~~~~~~
