/*
ID: varunra2
LANG: C++
TASK: crocodile
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define int long long
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) {
vector<bool> ext(n, false);
vector<VII> adj(n);
for (int i = 0; i < m; i++) {
int u, v, w;
u = r[i][0];
v = r[i][1];
w = l[i];
adj[u].PB(MP(v, w));
adj[v].PB(MP(u, w));
}
for (int i = 0; i < k; i++) {
ext[p[i]] = true;
}
priority_queue<PII, VII, greater<PII>> pq;
VI cnt(n, 2);
VI dist(n, INF);
for (int i = 0; i < n; i++) {
if (ext[i]) {
pq.push(MP(0, i));
}
}
vector<priority_queue<int>> dists(n);
while (!pq.empty()) {
int u, w;
u = pq.top().y;
w = pq.top().x;
pq.pop();
trav(x, adj[u]) {
if (sz(dists[x.x]) < 2)
dists[x.x].push(w + x.y);
else if (dists[x.x].top() > w + x.y) {
dists[x.x].pop();
dists[x.x].push(w + x.y);
}
if (sz(dists[x.x]) >= 2 and dist[x.x] > dists[x.x].top()) {
dist[x.x] = dists[x.x].top();
pq.push(MP(dist[x.x], x.x));
}
}
}
return dists[0].top();
}
// int main() {
// #ifndef ONLINE_JUDGE
// freopen("crocodile.in", "r", stdin);
// freopen("crocodile.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0);
// cin.tie(0);
// int n, m, k;
// cin >> n >> m >> k;
// int r[m][2];
// int l[m];
// int 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];
// }
// int x = travel_plan(n, m, r, l, k, p);
// debug(x);
// return 0;
// }
Compilation message
/tmp/ccNau6AL.o: In function `main':
grader.cpp:(.text.startup+0x2d): undefined reference to `travel_plan(int, int, int (*) [2], int*, int, int*)'
collect2: error: ld returned 1 exit status
