#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using aa= array<ll,3>;
const int N = 1e6+5;
const int INF = 1e9;
ll sr[100001][2];
ll d[100001][2];
vector<ii> adj[100001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int n,m,s,t,u,v;
cin >> n >> m;
cin >> s >> t;
cin >> u >> v;
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=1;i<=n;i++) {
d[i][0]=(ll)1e15;
d[i][1]=(ll)1e15;
sr[i][0]=(ll)1e15;
sr[i][1]=(ll)1e15;
}
priority_queue<aa,vector<aa>,greater<aa>> q;
q.push({0,s,0});
q.push({0,t,1});
sr[s][0]=0;
sr[t][1]=0;
while(!q.empty()) {
aa cur=q.top();
q.pop();
if(cur[0]>sr[cur[1]][cur[2]]) continue;
for(ii to:adj[cur[1]]) {
if(sr[to.fi][cur[2]]>sr[cur[1]][cur[2]]+to.se) {
sr[to.fi][cur[2]]=sr[cur[1]][cur[2]]+to.se;
q.push({sr[to.fi][cur[2]],to.fi,cur[2]});
}
}
}
q.push({0,u,0});
ll l=sr[t][0];
d[u][0]=0;
while(!q.empty()) {
aa cur=q.top();
q.pop();
if(cur[0]>d[cur[1]][cur[2]]) continue;
if(sr[cur[1]][0]+sr[cur[1]][1]==l && cur[2]==0) {
queue<int> bfs;
d[cur[1]][1]=min(d[cur[1]][1],d[cur[1]][0]);
for(ii to:adj[cur[1]]) {
if(sr[to.fi][0]+to.se==sr[cur[1]][0] && d[to.fi][1]>cur[0]) {
d[to.fi][1]=cur[0];
bfs.push(to.fi);
q.push({d[to.fi][1],to.fi,1});
}
}
while(!bfs.empty()) {
int k=bfs.front();
bfs.pop();
for(ii to:adj[k]) {
if(sr[to.fi][0]+to.se==sr[k][0] && d[to.fi][1]>d[k][1]) {
d[to.fi][1]=d[k][1];
bfs.push(to.fi);
q.push({d[to.fi][1],to.fi,1});
}
}
}
for(ii to:adj[cur[1]]) {
if(sr[to.fi][1]+to.se==sr[cur[1]][1] && d[to.fi][1]>cur[0]) {
d[to.fi][1]=cur[0];
bfs.push(to.fi);
q.push({d[to.fi][1],to.fi,1});
}
}
while(!bfs.empty()) {
int k=bfs.front();
bfs.pop();
for(ii to:adj[k]) {
if(sr[to.fi][1]+to.se==sr[k][1] && d[to.fi][1]>d[k][1]) {
d[to.fi][1]=d[k][1];
bfs.push(to.fi);
q.push({d[to.fi][1],to.fi,1});
}
}
}
}
for(ii to:adj[cur[1]]) {
if(d[to.fi][cur[2]]>d[cur[1]][cur[2]]+to.se) {
d[to.fi][cur[2]]=d[cur[1]][cur[2]]+to.se;
q.push({d[to.fi][cur[2]],to.fi,cur[2]});
}
}
}
cout << min(d[v][1],d[v][0]);
return 0;
}
Compilation message
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:22:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
22 | freopen("in.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:23:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
23 | freopen("out.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
8 ms |
10840 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
7 ms |
10844 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
7 ms |
10840 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
8 ms |
10840 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
