oj.uz

Submission #595156

# Submission time Handle Problem Language Result Execution time Memory
595156 2022-07-13T12:04:55 Z alexdd Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 469 ms 22416 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<tuple>
#include<algorithm>
#include<climits>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<long long, long long>
#define INF LLONG_MAX/2
ll n,m,s,t,u,v,ans;
vector<pii> con[100005];
ll du[100005];
ll dv[100005];
void dijkstra(ll src, ll dist[])
{
    for(int i=0;i<=n;i++)
        dist[i]=INF;
    dist[src]=0;
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    pq.push({0,src});
    ll cdist,nod,adj,w;
    while(!pq.empty())
    {
        tie(cdist,nod)=pq.top();
        pq.pop();
        if(cdist!=dist[nod])
            continue;
        for(auto aux:con[nod])
        {
            tie(adj,w)=aux;
            if(dist[adj]>dist[nod]+w)
            {
                dist[adj]=dist[nod]+w;
                pq.push({dist[adj],adj});
            }
        }
    }
}
ll dpu[100005];
ll dpv[100005];
ll dst[100005];
void dijkstra_parent(ll src, ll ult)
{
    for(int i=0;i<=n;i++)
        dpu[i]=dpv[i]=dst[i]=INF;
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    pq.push({0,src});
    dst[src]=0;
    dpu[src]=du[src];
    dpv[src]=dv[src];
    ll cdist,nod,adj,w;
    while(!pq.empty())
    {
        tie(cdist,nod)=pq.top();
        pq.pop();
        if(cdist!=dst[nod])
            continue;
        for(auto aux:con[nod])
        {
            tie(adj,w)=aux;
            if(dst[adj]>dst[nod]+w)
            {
                dst[adj]=dst[nod]+w;
                dpu[adj]=min(du[adj], dpu[nod]);
                dpv[adj]=min(dv[adj], dpv[nod]);
                pq.push({dst[adj],adj});
            }
            else if(dst[adj]==dst[nod]+w && min(du[adj], dpu[nod])+min(dv[adj], dpv[nod])<dpu[adj]+dpv[adj])
            {
                dpu[adj]=min(du[adj], dpu[nod]);
                dpv[adj]=min(dv[adj], dpv[nod]);
            }
        }
    }
    ans=min(ans,dpu[ult]+dpv[ult]);
}
int main()
{
    ll a,b,c;
    cin>>n>>m>>s>>t>>u>>v;
    for(ll i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        con[a].pb({b,c});
        con[b].pb({a,c});
    }
    dijkstra(u,du);
    dijkstra(v,dv);
    ans=du[v];
    dijkstra_parent(s,t);
    dijkstra_parent(t,s);
    cout<<ans<<"\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 407 ms 20148 KB Output is correct
2 Correct 401 ms 18852 KB Output is correct
3 Correct 420 ms 20112 KB Output is correct
4 Correct 398 ms 18896 KB Output is correct
5 Correct 409 ms 18680 KB Output is correct
6 Correct 403 ms 22416 KB Output is correct
7 Correct 394 ms 20944 KB Output is correct
8 Correct 407 ms 21060 KB Output is correct
9 Correct 431 ms 20824 KB Output is correct
10 Correct 374 ms 20832 KB Output is correct
11 Correct 210 ms 12880 KB Output is correct
12 Correct 469 ms 20916 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 18996 KB Output is correct
2 Correct 426 ms 18920 KB Output is correct
3 Correct 455 ms 18844 KB Output is correct
4 Correct 428 ms 18960 KB Output is correct
5 Correct 393 ms 18852 KB Output is correct
6 Correct 421 ms 18820 KB Output is correct
7 Correct 416 ms 18808 KB Output is correct
8 Correct 432 ms 18784 KB Output is correct
9 Correct 414 ms 18820 KB Output is correct
10 Correct 415 ms 18884 KB Output is correct
11 Correct 193 ms 11668 KB Output is correct
12 Correct 401 ms 18840 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4052 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 35 ms 5428 KB Output is correct
5 Correct 21 ms 4300 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 5 ms 2724 KB Output is correct
8 Correct 5 ms 2852 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 20 ms 4380 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2656 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2664 KB Output is correct
15 Correct 3 ms 2716 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 407 ms 20148 KB Output is correct
2 Correct 401 ms 18852 KB Output is correct
3 Correct 420 ms 20112 KB Output is correct
4 Correct 398 ms 18896 KB Output is correct
5 Correct 409 ms 18680 KB Output is correct
6 Correct 403 ms 22416 KB Output is correct
7 Correct 394 ms 20944 KB Output is correct
8 Correct 407 ms 21060 KB Output is correct
9 Correct 431 ms 20824 KB Output is correct
10 Correct 374 ms 20832 KB Output is correct
11 Correct 210 ms 12880 KB Output is correct
12 Correct 469 ms 20916 KB Output is correct
13 Correct 383 ms 18996 KB Output is correct
14 Correct 426 ms 18920 KB Output is correct
15 Correct 455 ms 18844 KB Output is correct
16 Correct 428 ms 18960 KB Output is correct
17 Correct 393 ms 18852 KB Output is correct
18 Correct 421 ms 18820 KB Output is correct
19 Correct 416 ms 18808 KB Output is correct
20 Correct 432 ms 18784 KB Output is correct
21 Correct 414 ms 18820 KB Output is correct
22 Correct 415 ms 18884 KB Output is correct
23 Correct 193 ms 11668 KB Output is correct
24 Correct 401 ms 18840 KB Output is correct
25 Correct 18 ms 4052 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 35 ms 5428 KB Output is correct
29 Correct 21 ms 4300 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 5 ms 2724 KB Output is correct
32 Correct 5 ms 2852 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 20 ms 4380 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 2 ms 2656 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 3 ms 2664 KB Output is correct
39 Correct 3 ms 2716 KB Output is correct
40 Correct 397 ms 21800 KB Output is correct
41 Correct 406 ms 21008 KB Output is correct
42 Correct 418 ms 21048 KB Output is correct
43 Correct 195 ms 12900 KB Output is correct
44 Correct 178 ms 12892 KB Output is correct
45 Correct 431 ms 20640 KB Output is correct
46 Correct 363 ms 20516 KB Output is correct
47 Correct 416 ms 22072 KB Output is correct
48 Correct 222 ms 12784 KB Output is correct
49 Correct 361 ms 21888 KB Output is correct
50 Correct 415 ms 20716 KB Output is correct
51 Correct 385 ms 20636 KB Output is correct