/*
Contest :
Task :
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define int long long
#define F first
#define S second
#define itr ::iterator
typedef pair<int,int> pii;
const int MAX=1e6+99;
set<pii> vec[MAX];
int V,E,Q,X,Y,Z,res[MAX];
void dijkstra()
{
int tem;
pii cur;
priority_queue<pii> pq;
pq.push(mp(MAX,1));
res[1]=MAX;
while(! pq.empty())
{
cur=pq.top();
pq.pop();
if(cur.first < res[cur.second])
continue;
for(auto A:vec[cur.second])
{
tem=min(cur.first,A.second);
if(tem>res[A.first])
{
res[A.first]=tem;
pq.push(mp(res[A.first],A.first));
}
}
for(auto A:vec[cur.second])
vec[A.first].erase(vec[A.first].find(mp(cur.second,A.second)));
vec[cur.second].clear();
}
return ;
}
signed main()
{
ios_base::sync_with_stdio(false);
/*cin.tie(0);
cout.tie(0);*/
cin>>V>>E>>Q;
while(E--)
{
cin>>X>>Y>>Z;
vec[X].insert(mp(Y,Z));
vec[Y].insert(mp(X,Z));
}
dijkstra();
while(Q--)
{
cin>>X;
cout<<res[X]<<"\n";
}
return 0;
Compilation message
sightseeing.cpp: In function 'int main()':
sightseeing.cpp:73:13: error: expected '}' at end of input
return 0;
^
