# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787358 | guagua0407 | Commuter Pass (JOI18_commuter_pass) | C++17 | 2080 ms | 66196 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=1e5+5;
vector<pair<int,ll>> adj[mxn];
int n,m;
vector<ll> dij(int node){
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
vector<ll> d(n,(ll)1e18);
d[node]=0;
pq.push({0,node});
while(!pq.empty()){
auto v=pq.top();
pq.pop();
if(v.f!=d[v.s]) continue;
for(auto u:adj[v.s]){
if(d[v.s]+u.s<d[u.f]){
d[u.f]=d[v.s]+u.s;
pq.push({d[u.f],u.f});
}
}
}
return d;
}
int main() {_
cin>>n>>m;
int S,T,U,V;
cin>>S>>T>>U>>V;
S--;
T--;
U--;
V--;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
adj[a].push_back({b,c});
adj[b].push_back({a,c});
}
vector<vector<ll>> d(n);
for(int i=0;i<n;i++){
d[i]=dij(i);
}
ll ans=(ll)1e18;
for(int i=0;i<n;i++){
if(d[S][i]+d[i][T]==d[S][T]){
ans=min(ans,d[i][V]);
}
}
cout<<min(d[U][V],ans)<<'\n';
return 0;
}
//maybe its multiset not set
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |