#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#include "crocodile.h"
using namespace std;
vector <pair<int,int > > adj[100000];
ll IN[100000][2];
bool vis[100000];
int Ein[100000],v,x;
ll dis[100000],d;
ll val;
struct cmp{
bool operator() (const int &a, const int &b) const {
if (Ein[a] >= 2 && Ein[b] >= 2)
return (dis[a] != dis[b] ? dis[a] < dis[b] : a < b );
return (Ein[a] > 2 ? 1 : Ein[b] > 2 ? 0 : (a < b);//Ein[a] > Ein[b];
return a<b;
}
};
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( { L [i], R[i][1] } );
adj[ R[i][1] ].push_back( { L[i] , R[i][0] });
}
for (int i = 0; i < 100000; i++)
dis[i] = 100000000000000;
set<int,cmp> s;
for (int i = 0; i < K; i++)
Ein[P[i]] = 2,dis[P[i]] = 0,s.insert (P[i]);
while (!s.empty()) {
v = *s.begin();
if (Ein[v] < 2) break;
s.erase(s.begin());
if (vis[v]) continue;
vis[v] = 1;
for (auto i : adj[v]) {
x = i.se;
if (vis[x]) continue;
s.erase(x);
d = i.fi + dis[v];
if (IN[x][0] == 0) IN[x][0] = d;
else if (IN[x][1] == 0) {
IN[x][1] = d;
if (IN[x][0] > IN[x][1]) swap(IN[x][0],IN[x][1]);
}
else if (IN[x][1] > d) {
IN[x][1] = d;
if (IN[x][0] > IN[x][1]) swap(IN[x][0],IN[x][1]);
}
Ein[x] ++;
if (IN[x][1] && dis[x] > IN[x][1]) {
dis[x] = IN[x][1];
}
s.insert (x);
}
}
return dis[0];
} /*
main() {
} */
Compilation message
crocodile.cpp: In member function 'bool cmp::operator()(const int&, const int&) const':
crocodile.cpp:17:52: error: expected ')' before ';' token
return (Ein[a] > 2 ? 1 : Ein[b] > 2 ? 0 : (a < b);//Ein[a] > Ein[b];
^
