oj.uz

Submission #884795

# Submission time Handle Problem Language Result Execution time Memory
884795 2023-12-08T12:29:45 Z tosivanmak Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 261 ms 35016 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long

vector<pair<ll,ll> >adj[200005];
ll dist[200005];
ll fromu[200005],fromv[200005],cop[200005];
bool visited[200005];
priority_queue<pair<ll,ll> >q;
ll ans[200005],ans2[200005];
ll stdist,uvdist;
void D(ll s){
    dist[s]=0;
    q.push({0,s});
    while(!q.empty()){
        pair<ll,ll>lol=q.top();
        q.pop();
        if(visited[lol.second]){
            continue;
        }
        visited[lol.second]=true;
        for(auto u: adj[lol.second]){
            if(dist[lol.second]+u.second<dist[u.first]){
                dist[u.first]=dist[lol.second]+u.second;
                q.push({-dist[u.first],u.first});
            }
        }
    }
}
void D2(ll s){
    dist[s]=0;
    q.push({0,s});
    while(!q.empty()){
        pair<ll,ll>lol=q.top();
        q.pop();
        if(visited[lol.second]){
            continue;
        }
        visited[lol.second]=true;
        ans[lol.second]=min(ans[lol.second],fromu[lol.second]);
        for(auto u: adj[lol.second]){
            if(dist[lol.second]+u.second==dist[u.first]){
                ans[u.first]=min(ans[u.first],ans[lol.second]);
            }
            else if(dist[lol.second]+u.second<dist[u.first]){
                dist[u.first]=dist[lol.second]+u.second;
                ans[u.first]=ans[lol.second];
                q.push({-dist[u.first],u.first});
            }
        }
    }
}
void D3(ll s){
    dist[s]=0;
    q.push({0,s});
    while(!q.empty()){
        pair<ll,ll>lol=q.top();
        q.pop();
        if(visited[lol.second]){
            continue;
        }
        visited[lol.second]=true;
        ans2[lol.second]=min(ans2[lol.second],fromu[lol.second]);
        for(auto u: adj[lol.second]){
            if(dist[lol.second]+u.second==dist[u.first]){
                ans2[u.first]=min(ans2[u.first],ans2[lol.second]);
            }
            else if(dist[lol.second]+u.second<dist[u.first]){
                dist[u.first]=dist[lol.second]+u.second;
                ans2[u.first]=ans2[lol.second];
                q.push({-dist[u.first],u.first});
            }
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll n,m,s,t,u,v;
    cin>>n>>m>>s>>t>>u>>v;
    ll a[m+5],b[m+5],c[m+5];
    for(int i=1;i<=m;i++){
        cin>>a[i]>>b[i]>>c[i];
      adj[a[i]].push_back({b[i],c[i]});
      adj[b[i]].push_back({a[i],c[i]});
    }
    for(int i=1;i<=n;i++){
        dist[i]=1e17;
        visited[i]=false;
    }
    D(u);
    uvdist=dist[v];
    for(int i=1;i<=n;i++){
        fromu[i]=dist[i];
        // cout<<dist[i]<<" ";
        dist[i]=1e17;
        visited[i]=false;
    }
    // cout<<'\n';
    D(v);
    for(int i=1;i<=n;i++){
        fromv[i]=dist[i];
        // cout<<dist[i]<<" ";
        dist[i]=1e17;
        visited[i]=false;
    }
    for(int i=1;i<=n;i++){
       ans[i]=1e17;
       ans2[i]=1e17;
    //    cout<<ans[i]<<" ";
    }
    D2(s);
    stdist=dist[t];
    for(int i=1;i<=n;i++){
        cop[i]=dist[i];
        dist[i]=1e17;
        visited[i]=false;
    }
    D3(t);
    // cout<<uvdist<<'\n';
    for(int i=1;i<=n;i++){
        if(cop[i]+dist[i]==stdist){
            // cout<<i<<" "<<cop[i]<<" "<<dist[i]<<" ";
            // cout<<ans[i]<<" "<<fromv[i]<<'\n';
            uvdist=min(uvdist,min(ans[i],ans2[i])+fromv[i]);
            // cout<<i<<" ";
        }
    }
    // for(int i=1;i<=n;i++){
    //     cout<<ans[i]<<" "<<ans2[i]<<"\n";
    // }
    cout<<uvdist<<'\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 31092 KB Output is correct
2 Correct 211 ms 30920 KB Output is correct
3 Correct 209 ms 31940 KB Output is correct
4 Correct 203 ms 30904 KB Output is correct
5 Correct 189 ms 30664 KB Output is correct
6 Correct 240 ms 30880 KB Output is correct
7 Correct 191 ms 30668 KB Output is correct
8 Correct 186 ms 30832 KB Output is correct
9 Correct 193 ms 30508 KB Output is correct
10 Correct 148 ms 30400 KB Output is correct
11 Correct 59 ms 22228 KB Output is correct
12 Correct 240 ms 34756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 31176 KB Output is correct
2 Correct 236 ms 30868 KB Output is correct
3 Correct 225 ms 30660 KB Output is correct
4 Correct 194 ms 30668 KB Output is correct
5 Correct 200 ms 30660 KB Output is correct
6 Correct 194 ms 30876 KB Output is correct
7 Correct 215 ms 30648 KB Output is correct
8 Correct 192 ms 30664 KB Output is correct
9 Correct 211 ms 30588 KB Output is correct
10 Correct 223 ms 30660 KB Output is correct
11 Correct 61 ms 22352 KB Output is correct
12 Correct 195 ms 34496 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16316 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 13 ms 18268 KB Output is correct
5 Correct 8 ms 16220 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 4 ms 14684 KB Output is correct
9 Correct 4 ms 14684 KB Output is correct
10 Correct 8 ms 16220 KB Output is correct
11 Correct 3 ms 14592 KB Output is correct
12 Correct 3 ms 14428 KB Output is correct
13 Correct 3 ms 14624 KB Output is correct
14 Correct 3 ms 14424 KB Output is correct
15 Correct 3 ms 14660 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 31092 KB Output is correct
2 Correct 211 ms 30920 KB Output is correct
3 Correct 209 ms 31940 KB Output is correct
4 Correct 203 ms 30904 KB Output is correct
5 Correct 189 ms 30664 KB Output is correct
6 Correct 240 ms 30880 KB Output is correct
7 Correct 191 ms 30668 KB Output is correct
8 Correct 186 ms 30832 KB Output is correct
9 Correct 193 ms 30508 KB Output is correct
10 Correct 148 ms 30400 KB Output is correct
11 Correct 59 ms 22228 KB Output is correct
12 Correct 240 ms 34756 KB Output is correct
13 Correct 222 ms 31176 KB Output is correct
14 Correct 236 ms 30868 KB Output is correct
15 Correct 225 ms 30660 KB Output is correct
16 Correct 194 ms 30668 KB Output is correct
17 Correct 200 ms 30660 KB Output is correct
18 Correct 194 ms 30876 KB Output is correct
19 Correct 215 ms 30648 KB Output is correct
20 Correct 192 ms 30664 KB Output is correct
21 Correct 211 ms 30588 KB Output is correct
22 Correct 223 ms 30660 KB Output is correct
23 Correct 61 ms 22352 KB Output is correct
24 Correct 195 ms 34496 KB Output is correct
25 Correct 11 ms 16316 KB Output is correct
26 Correct 3 ms 14428 KB Output is correct
27 Correct 3 ms 14428 KB Output is correct
28 Correct 13 ms 18268 KB Output is correct
29 Correct 8 ms 16220 KB Output is correct
30 Correct 3 ms 14684 KB Output is correct
31 Correct 3 ms 14684 KB Output is correct
32 Correct 4 ms 14684 KB Output is correct
33 Correct 4 ms 14684 KB Output is correct
34 Correct 8 ms 16220 KB Output is correct
35 Correct 3 ms 14592 KB Output is correct
36 Correct 3 ms 14428 KB Output is correct
37 Correct 3 ms 14624 KB Output is correct
38 Correct 3 ms 14424 KB Output is correct
39 Correct 3 ms 14660 KB Output is correct
40 Correct 190 ms 34800 KB Output is correct
41 Correct 198 ms 34932 KB Output is correct
42 Correct 218 ms 35016 KB Output is correct
43 Correct 68 ms 24440 KB Output is correct
44 Correct 65 ms 24400 KB Output is correct
45 Correct 164 ms 33732 KB Output is correct
46 Correct 161 ms 33372 KB Output is correct
47 Correct 261 ms 34660 KB Output is correct
48 Correct 72 ms 23636 KB Output is correct
49 Correct 170 ms 34364 KB Output is correct
50 Correct 234 ms 33868 KB Output is correct
51 Correct 154 ms 33732 KB Output is correct