oj.uz

Submission #590342

# Submission time Handle Problem Language Result Execution time Memory
590342 2022-07-05T21:07:33 Z Urvuk3 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 373 ms 30972 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
const ll INF=1e9,LINF=1e18,MAXN=1e5+1;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define pb push_back
#define PRINTvec(x) { cerr<<#x<<"="; for(int i=0;i<sz(x);i++) cerr<<x[i]<<" "; cerr<<endl; }

int N,M,S,T,U,V;
vector<pair<int,ll>> adj[MAXN];
vector<int> dag[MAXN];
vector<ll> dist1(MAXN),dist2(MAXN),dpU(MAXN,LINF),dpV(MAXN,LINF),dp(MAXN,LINF);
vector<bool> visited(MAXN);
vector<int> topo;

void Dijkstra(int src,vector<ll>& dist){
    for(int i=1;i<=N;i++){
        dist[i]=0;
        visited[i]=0;
    }
    priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
    pq.push({0,src});
    while(!pq.empty()){
        pair<ll,int> vrh=pq.top(); pq.pop();
        if(!visited[vrh.se]){
            visited[vrh.se]=true;
            dist[vrh.se]=vrh.fi;
            for(auto x:adj[vrh.se]){
                if(!visited[x.fi]) pq.push({dist[vrh.se]+x.se,x.fi});
            }
        }
    }
}

void TopoSort(int node){
    visited[node]=true;
    for(auto x:dag[node]) if(!visited[x]) TopoSort(x);
    topo.pb(node);
}

void Solve(){
    cin>>N>>M>>S>>T>>U>>V;
    for(int i=0;i<M;i++){
        int u,v,w;
        cin>>u>>v>>w;
        adj[u].pb({v,w});
        adj[v].pb({u,w});
    }
    Dijkstra(S,dist1);
    Dijkstra(T,dist2);
    for(int i=1;i<=N;i++){
        for(auto x:adj[i]){
            if(dist1[i]+x.se+dist2[x.fi]==dist1[T]){
                dag[i].pb(x.fi);
                //PRINT(i); PRINT(x.fi);
            }
        }
    }
    for(int i=1;i<=N;i++) visited[i]=false;
    TopoSort(S); reverse(all(topo));
    //PRINTvec(topo);
    Dijkstra(U,dist1);
    Dijkstra(V,dist2);
    while(!topo.empty()){
        int node=topo.back(); topo.pop_back();
        //PRINT(node); PRINT(dist1[node]); PRINT(dist2[node]);
        dp[node]=dist1[node]+dist2[node]; //PRINT(dp[node]);
        dpU[node]=dist1[node]; //PRINT(dpU[node]);
        dpV[node]=dist2[node]; //PRINT(dpV[node]);
        for(auto x:dag[node]){
            dpU[node]=min(dpU[node],dpU[x]);
            dpV[node]=min(dpV[node],dpV[x]);
            dp[node]=min(dp[node],dp[x]);
        }
        dp[node]=min({dp[node],dpU[node]+dist2[node],dpV[node]+dist1[node]});
        //PRINT(dp[node]); PRINT(dpU[node]); PRINT(dpV[node]);
    }
    cout<<min(dp[S],dist1[V])<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    //cin>>t;
    t=1;
    while(t--){
        Solve();
    }
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 27040 KB Output is correct
2 Correct 316 ms 26768 KB Output is correct
3 Correct 312 ms 30972 KB Output is correct
4 Correct 323 ms 26808 KB Output is correct
5 Correct 373 ms 27040 KB Output is correct
6 Correct 325 ms 27020 KB Output is correct
7 Correct 303 ms 27736 KB Output is correct
8 Correct 302 ms 27464 KB Output is correct
9 Correct 322 ms 27116 KB Output is correct
10 Correct 301 ms 27268 KB Output is correct
11 Correct 123 ms 19528 KB Output is correct
12 Correct 329 ms 26956 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 28152 KB Output is correct
2 Correct 326 ms 27984 KB Output is correct
3 Correct 305 ms 27456 KB Output is correct
4 Correct 318 ms 27804 KB Output is correct
5 Correct 300 ms 28472 KB Output is correct
6 Correct 339 ms 30372 KB Output is correct
7 Correct 301 ms 30804 KB Output is correct
8 Correct 311 ms 27840 KB Output is correct
9 Correct 345 ms 28460 KB Output is correct
10 Correct 297 ms 27492 KB Output is correct
11 Correct 108 ms 21196 KB Output is correct
12 Correct 334 ms 30752 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11152 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 5 ms 8916 KB Output is correct
4 Correct 44 ms 13272 KB Output is correct
5 Correct 22 ms 11468 KB Output is correct
6 Correct 7 ms 9044 KB Output is correct
7 Correct 7 ms 9172 KB Output is correct
8 Correct 8 ms 9212 KB Output is correct
9 Correct 6 ms 9044 KB Output is correct
10 Correct 22 ms 11360 KB Output is correct
11 Correct 5 ms 8968 KB Output is correct
12 Correct 5 ms 9044 KB Output is correct
13 Correct 5 ms 8916 KB Output is correct
14 Correct 6 ms 8992 KB Output is correct
15 Correct 6 ms 9000 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 27040 KB Output is correct
2 Correct 316 ms 26768 KB Output is correct
3 Correct 312 ms 30972 KB Output is correct
4 Correct 323 ms 26808 KB Output is correct
5 Correct 373 ms 27040 KB Output is correct
6 Correct 325 ms 27020 KB Output is correct
7 Correct 303 ms 27736 KB Output is correct
8 Correct 302 ms 27464 KB Output is correct
9 Correct 322 ms 27116 KB Output is correct
10 Correct 301 ms 27268 KB Output is correct
11 Correct 123 ms 19528 KB Output is correct
12 Correct 329 ms 26956 KB Output is correct
13 Correct 324 ms 28152 KB Output is correct
14 Correct 326 ms 27984 KB Output is correct
15 Correct 305 ms 27456 KB Output is correct
16 Correct 318 ms 27804 KB Output is correct
17 Correct 300 ms 28472 KB Output is correct
18 Correct 339 ms 30372 KB Output is correct
19 Correct 301 ms 30804 KB Output is correct
20 Correct 311 ms 27840 KB Output is correct
21 Correct 345 ms 28460 KB Output is correct
22 Correct 297 ms 27492 KB Output is correct
23 Correct 108 ms 21196 KB Output is correct
24 Correct 334 ms 30752 KB Output is correct
25 Correct 24 ms 11152 KB Output is correct
26 Correct 5 ms 8916 KB Output is correct
27 Correct 5 ms 8916 KB Output is correct
28 Correct 44 ms 13272 KB Output is correct
29 Correct 22 ms 11468 KB Output is correct
30 Correct 7 ms 9044 KB Output is correct
31 Correct 7 ms 9172 KB Output is correct
32 Correct 8 ms 9212 KB Output is correct
33 Correct 6 ms 9044 KB Output is correct
34 Correct 22 ms 11360 KB Output is correct
35 Correct 5 ms 8968 KB Output is correct
36 Correct 5 ms 9044 KB Output is correct
37 Correct 5 ms 8916 KB Output is correct
38 Correct 6 ms 8992 KB Output is correct
39 Correct 6 ms 9000 KB Output is correct
40 Correct 295 ms 26592 KB Output is correct
41 Correct 325 ms 27032 KB Output is correct
42 Correct 311 ms 26980 KB Output is correct
43 Correct 144 ms 22068 KB Output is correct
44 Correct 116 ms 22060 KB Output is correct
45 Correct 345 ms 27452 KB Output is correct
46 Correct 329 ms 27308 KB Output is correct
47 Correct 293 ms 26528 KB Output is correct
48 Correct 128 ms 19960 KB Output is correct
49 Correct 292 ms 26084 KB Output is correct
50 Correct 357 ms 26956 KB Output is correct
51 Correct 328 ms 27628 KB Output is correct