using namespace std;
#include <bits/stdc++.h>
#define ll long long
int dp[100001];
int n;
int m, k;
vector<pair<int, int>> adj[100001];
map<int, int> is;
void dfs(int v, int p = -1)
{
if (adj[v].size() == 1)
{
if (is[v])
dp[v] = 0;
else
dp[v] = 1e9;
return;
}
vector<int> store;
for (auto it : adj[v])
{
if (it.first == p)
continue;
dfs(it.first, v);
store.push_back(dp[it.first] + it.second);
}
sort(store.begin(), store.end());
dp[v] = store[1];
}
// void solve()
// {
// cin >> n >> m >> k;
// for (int i = 0; i <= n; i++)
// {
// adj[i].clear();
// dp[i] = 0;
// }
// is.clear();
// for (int i = 0; i < m; i++)
// {
// int a, b, c;
// cin >> a >> b >> c;
// adj[a].push_back({b, c});
// adj[b].push_back({a, c});
// }
// for (int i = 0; i < k; i++)
// {
// int a;
// cin >> a;
// is[a] = 1;
// }
// dfs(0);
// cout << dp[0] << endl;
// }
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(make_pair(R[i][1], L[i]));
adj[R[i][1]].push_back(make_pair(R[i][0], L[i]));
}
map<int, int> f;
vector<int> d(n + 1, 1e9);
vector<bool> visited(n + 1, 0);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
for (int i = 0; i < K; i++)
{
//is[P[i]] = 1;
q.push({0, P[i]});
visited[P[i]] = 1;
}
while (!q.empty())
{
int dt = q.top().first;
int node = q.top().second;
q.pop();
if (visited[node] == 1)
{
is[node] = 1;
d[node] = dt;
for (auto it : adj[node])
{
if (!visited[it.first])
{
q.push({dt + it.second, it.first});
}
}
}
visited[node]++;
}
return d[0];
}
Compilation message
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:89:22: error: no 'operator++(int)' declared for postfix '++' [-fpermissive]
89 | visited[node]++;
| ~~~~~~~~~~~~~^~
