oj.uz

Submission #783522

# Submission time Handle Problem Language Result Execution time Memory
783522 2023-07-15T02:40:42 Z 8pete8 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 217 ms 25704 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define p push
#define pii pair<int,int>
#define ppii pair<int,pii>
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#define set(x) memset(x,-1,sizeof(x));
int n,m,s,t,u,v;
#define int long long
const int mxn=1e5,inf=LONG_LONG_MAX/2;
vector<pii>adj[mxn+10];
bitset<mxn+10>vis;
void dijk(int st,vector<int>&dist){
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    pq.p({0,st});
    dist[st]=0;
    while(!pq.empty()){
        int cur=pq.top().s;
        pq.pop();
        if(vis[cur])continue;
        vis[cur]=true;
        for(auto i:adj[cur]){
            if(dist[i.f]>dist[cur]+i.s)dist[i.f]=dist[cur]+i.s,pq.p({dist[i.f],i.f});
        }
    }
    vis.reset();
}
int32_t main(){
    fastio
    cin>>n>>m>>s>>t>>u>>v;
    while(m--){
        int a,b,c;cin>>a>>b>>c;
        adj[a].pb({b,c});
        adj[b].pb({a,c});
    }
    vector<int>dist1(n+1,inf);
    vector<int>dist2(n+1,inf);
    dijk(u,dist1);
    dijk(v,dist2);
    priority_queue<ppii,vector<ppii>,greater<ppii>>pq;
    //dist cur pa
    pq.p({0,{s,0}});
    vector<pair<int,pii>>dist(n+1,{inf,{inf,inf}});
    dist[s].f=0;
    while(!pq.empty()){
        int cur=pq.top().s.f,pa=pq.top().s.s,cd=pq.top().f;
        pq.pop();
        if(vis[cur]){
            if(cd==dist[cur].f){
                int cnu=min(dist1[cur],dist[pa].s.f),cnv=min(dist2[cur],dist[pa].s.s);
                if(cnu+cnv<=dist[cur].s.f+dist[cur].s.s){
                    dist[cur].s.f=cnu;
                    dist[cur].s.s=cnv;
                }
            }
            continue;
        }
        vis[cur]=true;
        dist[cur].s.f=min(dist1[cur],dist[pa].s.f);
        dist[cur].s.s=min(dist2[cur],dist[pa].s.s);
        for(auto i:adj[cur]){
            if(dist[i.f].f==-1||dist[i.f].f>=dist[cur].f+i.s){
                int ndu=min(dist[cur].s.f,dist1[i.f]),ndv=min(dist[cur].s.s,dist2[i.f]);
                dist[i.f]={dist[cur].f+i.s,{ndu,ndv}};
                pq.p({dist[i.f].f,{i.f,cur}});
            }
        }
    }
    cout<<min(dist[t].s.f+dist[t].s.s,dist1[v]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 21792 KB Output is correct
2 Correct 189 ms 19880 KB Output is correct
3 Correct 176 ms 19356 KB Output is correct
4 Correct 195 ms 21812 KB Output is correct
5 Correct 183 ms 19712 KB Output is correct
6 Correct 180 ms 21768 KB Output is correct
7 Correct 189 ms 19840 KB Output is correct
8 Correct 217 ms 19984 KB Output is correct
9 Correct 172 ms 19660 KB Output is correct
10 Correct 151 ms 19608 KB Output is correct
11 Correct 98 ms 11852 KB Output is correct
12 Correct 213 ms 19740 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 20000 KB Output is correct
2 Correct 188 ms 19776 KB Output is correct
3 Correct 191 ms 19708 KB Output is correct
4 Correct 195 ms 19836 KB Output is correct
5 Correct 182 ms 19784 KB Output is correct
6 Correct 182 ms 19420 KB Output is correct
7 Correct 207 ms 19692 KB Output is correct
8 Correct 200 ms 19740 KB Output is correct
9 Correct 189 ms 19812 KB Output is correct
10 Correct 192 ms 19732 KB Output is correct
11 Correct 57 ms 11724 KB Output is correct
12 Correct 192 ms 19348 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4464 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 14 ms 5924 KB Output is correct
5 Correct 7 ms 4052 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2940 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 6 ms 4436 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 21792 KB Output is correct
2 Correct 189 ms 19880 KB Output is correct
3 Correct 176 ms 19356 KB Output is correct
4 Correct 195 ms 21812 KB Output is correct
5 Correct 183 ms 19712 KB Output is correct
6 Correct 180 ms 21768 KB Output is correct
7 Correct 189 ms 19840 KB Output is correct
8 Correct 217 ms 19984 KB Output is correct
9 Correct 172 ms 19660 KB Output is correct
10 Correct 151 ms 19608 KB Output is correct
11 Correct 98 ms 11852 KB Output is correct
12 Correct 213 ms 19740 KB Output is correct
13 Correct 194 ms 20000 KB Output is correct
14 Correct 188 ms 19776 KB Output is correct
15 Correct 191 ms 19708 KB Output is correct
16 Correct 195 ms 19836 KB Output is correct
17 Correct 182 ms 19784 KB Output is correct
18 Correct 182 ms 19420 KB Output is correct
19 Correct 207 ms 19692 KB Output is correct
20 Correct 200 ms 19740 KB Output is correct
21 Correct 189 ms 19812 KB Output is correct
22 Correct 192 ms 19732 KB Output is correct
23 Correct 57 ms 11724 KB Output is correct
24 Correct 192 ms 19348 KB Output is correct
25 Correct 10 ms 4464 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 14 ms 5924 KB Output is correct
29 Correct 7 ms 4052 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2940 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 6 ms 4436 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 201 ms 25704 KB Output is correct
41 Correct 171 ms 24008 KB Output is correct
42 Correct 189 ms 24108 KB Output is correct
43 Correct 75 ms 13876 KB Output is correct
44 Correct 59 ms 13964 KB Output is correct
45 Correct 175 ms 23056 KB Output is correct
46 Correct 180 ms 22744 KB Output is correct
47 Correct 174 ms 25704 KB Output is correct
48 Correct 60 ms 13344 KB Output is correct
49 Correct 171 ms 25612 KB Output is correct
50 Correct 194 ms 23084 KB Output is correct
51 Correct 180 ms 22996 KB Output is correct