oj.uz

Submission #943112

# Submission time Handle Problem Language Result Execution time Memory
943112 2024-03-11T08:23:01 Z noyancanturk Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 251 ms 25588 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=1e5+500;
#else
    const int lim=3e3+3;
#endif
    
#include "bits/stdc++.h"
using namespace std;
    
#define int int64_t
#define pb push_back
    
const int mod=998244353;
//const int mod=(1ll<<61)-1;

using pii=pair<int,int>;
vector<pii>v[lim];

int n,m;
inline void dj(int s,int*dist){
    for(int i=1;i<=n;i++)dist[i]=LLONG_MAX;
    dist[s]=0;
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    pq.push({0,s});
    while(pq.size()){
        auto [tm,now]=pq.top();
        pq.pop();
        if(tm^dist[now])continue;
        for(auto [j,c]:v[now]){
            if(dist[now]+c<dist[j]){
                dist[j]=dist[now]+c;
                pq.push({dist[j],j});
            }
        }
    }
}

inline void solve(){
    cin>>n>>m;
    int s,t;
    cin>>s>>t;
    int a,b;
    cin>>a>>b;
    for(int i=0;i<m;i++){
        int x,y,c;
        cin>>x>>y>>c;
        v[x].pb({y,c});
        v[y].pb({x,c});
    }
    int dist[n+1],lead[n+1];
    for(int i=0;i<=n;i++){
        dist[i]=LLONG_MAX;
        lead[i]=0;
    }
    dist[s]=lead[s]=0;
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    pq.push({0,s});
    while(pq.size()){
        auto [tm,now]=pq.top();
        pq.pop();
        if(tm^dist[now])continue;
        for(auto [j,c]:v[now]){
            if(dist[now]+c<dist[j]){
                dist[j]=dist[now]+c;
                pq.push({dist[j],j});
                lead[j]=1;
            }else if(dist[now]+c==dist[j]){
                lead[j]++;
            }
        }
    }
    int dista[n+1],distb[n+1],distT[n+1];
    dj(a,dista);
    dj(b,distb);
    dj(t,distT);
    int ans=dista[b],dpa[n+1],dpb[n+1];
    for(int i=0;i<=n;i++){
        dpa[i]=dpb[i]=LLONG_MAX;
    }
    dpa[s]=distb[s];
    dpb[s]=dista[s];
    queue<int>q;
    q.push(s);
    while(q.size()){
        int now=q.front();
        q.pop();
        dpa[now]=min(dpa[now],distb[now]);
        dpb[now]=min(dpb[now],dista[now]);
        ans=min(ans,dpa[now]+dista[now]);
        ans=min(ans,dpb[now]+distb[now]);
        for(auto [j,c]:v[now]){
            if(dist[now]+c+distT[j]==dist[t]){
                dpa[j]=min(dpa[j],dpa[now]);
                dpb[j]=min(dpb[j],dpb[now]);
                if(!(--lead[j])){
                    q.push(j);
                }
            }
        }
    }
    cout<<ans<<"\n";
}
    
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else

#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 25164 KB Output is correct
2 Correct 225 ms 23684 KB Output is correct
3 Correct 217 ms 24508 KB Output is correct
4 Correct 220 ms 25368 KB Output is correct
5 Correct 189 ms 23072 KB Output is correct
6 Correct 195 ms 25228 KB Output is correct
7 Correct 233 ms 23292 KB Output is correct
8 Correct 234 ms 23524 KB Output is correct
9 Correct 180 ms 24016 KB Output is correct
10 Correct 187 ms 24032 KB Output is correct
11 Correct 60 ms 15444 KB Output is correct
12 Correct 251 ms 23952 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 24032 KB Output is correct
2 Correct 202 ms 23200 KB Output is correct
3 Correct 209 ms 23336 KB Output is correct
4 Correct 240 ms 23420 KB Output is correct
5 Correct 218 ms 23304 KB Output is correct
6 Correct 188 ms 23392 KB Output is correct
7 Correct 251 ms 23052 KB Output is correct
8 Correct 197 ms 23356 KB Output is correct
9 Correct 203 ms 23300 KB Output is correct
10 Correct 213 ms 23240 KB Output is correct
11 Correct 62 ms 15444 KB Output is correct
12 Correct 233 ms 23348 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4444 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 2 ms 2648 KB Output is correct
4 Correct 10 ms 6232 KB Output is correct
5 Correct 7 ms 4444 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 6 ms 4444 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 25164 KB Output is correct
2 Correct 225 ms 23684 KB Output is correct
3 Correct 217 ms 24508 KB Output is correct
4 Correct 220 ms 25368 KB Output is correct
5 Correct 189 ms 23072 KB Output is correct
6 Correct 195 ms 25228 KB Output is correct
7 Correct 233 ms 23292 KB Output is correct
8 Correct 234 ms 23524 KB Output is correct
9 Correct 180 ms 24016 KB Output is correct
10 Correct 187 ms 24032 KB Output is correct
11 Correct 60 ms 15444 KB Output is correct
12 Correct 251 ms 23952 KB Output is correct
13 Correct 217 ms 24032 KB Output is correct
14 Correct 202 ms 23200 KB Output is correct
15 Correct 209 ms 23336 KB Output is correct
16 Correct 240 ms 23420 KB Output is correct
17 Correct 218 ms 23304 KB Output is correct
18 Correct 188 ms 23392 KB Output is correct
19 Correct 251 ms 23052 KB Output is correct
20 Correct 197 ms 23356 KB Output is correct
21 Correct 203 ms 23300 KB Output is correct
22 Correct 213 ms 23240 KB Output is correct
23 Correct 62 ms 15444 KB Output is correct
24 Correct 233 ms 23348 KB Output is correct
25 Correct 6 ms 4444 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 10 ms 6232 KB Output is correct
29 Correct 7 ms 4444 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 2 ms 2904 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 6 ms 4444 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 2 ms 2908 KB Output is correct
39 Correct 2 ms 2908 KB Output is correct
40 Correct 217 ms 25588 KB Output is correct
41 Correct 219 ms 24044 KB Output is correct
42 Correct 180 ms 24104 KB Output is correct
43 Correct 72 ms 15568 KB Output is correct
44 Correct 69 ms 15444 KB Output is correct
45 Correct 192 ms 22584 KB Output is correct
46 Correct 236 ms 22312 KB Output is correct
47 Correct 198 ms 24776 KB Output is correct
48 Correct 88 ms 15036 KB Output is correct
49 Correct 158 ms 25092 KB Output is correct
50 Correct 231 ms 23124 KB Output is correct
51 Correct 191 ms 22580 KB Output is correct