#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b>N>>M>>S>>G; vector>E(N); REP(i,M){ ll u,v,c;cin>>u>>v>>c; E[u].emplace_back(PA(v,c)); E[v].emplace_back(PA(u,c)); } vectorD(N,1e18);D[G]=0; min_priority_queueQ; Q.push(PA(0,G)); while(sz(Q)){ ll v=Q.top().S;Q.pop(); for(auto[u,c]:E[v])if(chmin(D[u],D[v]+c))Q.push(PA(D[u],u)); } REP(i,N)sort(ALL(E[i])); vectorans; while(S!=G){ ans.emplace_back(S); for(auto[v,c]:E[S])if(D[v]==D[S]-c){ S=v;break; } } ans.emplace_back(G); cout<