oj.uz

Submission #941805

# Submission time Handle Problem Language Result Execution time Memory
941805 2024-03-09T13:17:06 Z carriewang Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 241 ms 45296 KB 
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
#define F first
#define S second
using namespace std;
const int maxn=1000005;
ll n,m,s,t,u,v,a,b,c;
vector<pll> g[maxn];
vector<ll> dist(int x){
    vector<ll> ret(n,1e18);
    priority_queue<pll,vector<pll>,greater<pll>> pq;
    pq.emplace(0,x);
    ret[x]=0;
    while(!pq.empty()){
        auto [p,q]=pq.top();
        pq.pop();
        if(p>ret[q]) continue;
        for(auto [y,z]:g[q]){
            if(p+z<ret[y]){
                pq.emplace(p+z,y);
                ret[y]=p+z;
            }
        }
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    cin >> s >> t >> u >> v;
    s--,t--,u--,v--;
    for(int i=0;i<m;i++){
        cin >> a >> b >> c;
        a--,b--;
        g[a].emplace_back(b,c);
        g[b].emplace_back(a,c);
    }
    auto ds=dist(s),dt=dist(t),du=dist(u),dv=dist(v);
    vector<pll> ask;
    for(int i=0;i<n;i++){
        if(ds[i]+dt[i]==ds[t]) ask.emplace_back(dt[i],i);
    }
    sort(all(ask));
    ll ans=du[v];
    vector<ll> um(n,1e18),vm(n,1e18);
    for(auto [_,x]:ask){
        um[x]=du[x],vm[x]=dv[x];
        for(auto [p,q]:g[x]){
            if(dt[p]+q==dt[x]){
                um[x]=min(um[x],um[p]);
                vm[x]=min(vm[x],vm[p]);
            }
            ans=min(ans,min(um[x]+dv[x],vm[x]+du[x]));
        }
    }
    cout << ans << "\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 44356 KB Output is correct
2 Correct 212 ms 43488 KB Output is correct
3 Correct 200 ms 44228 KB Output is correct
4 Correct 218 ms 44320 KB Output is correct
5 Correct 176 ms 43380 KB Output is correct
6 Correct 201 ms 45296 KB Output is correct
7 Correct 235 ms 43492 KB Output is correct
8 Correct 190 ms 43520 KB Output is correct
9 Correct 229 ms 43604 KB Output is correct
10 Correct 146 ms 43520 KB Output is correct
11 Correct 80 ms 36784 KB Output is correct
12 Correct 205 ms 43364 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 43608 KB Output is correct
2 Correct 221 ms 43664 KB Output is correct
3 Correct 196 ms 43232 KB Output is correct
4 Correct 229 ms 43480 KB Output is correct
5 Correct 229 ms 43684 KB Output is correct
6 Correct 187 ms 43684 KB Output is correct
7 Correct 227 ms 43744 KB Output is correct
8 Correct 241 ms 43488 KB Output is correct
9 Correct 207 ms 43136 KB Output is correct
10 Correct 231 ms 43268 KB Output is correct
11 Correct 77 ms 37060 KB Output is correct
12 Correct 204 ms 43932 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 25692 KB Output is correct
2 Correct 7 ms 24008 KB Output is correct
3 Correct 5 ms 24004 KB Output is correct
4 Correct 16 ms 27228 KB Output is correct
5 Correct 10 ms 25432 KB Output is correct
6 Correct 6 ms 23900 KB Output is correct
7 Correct 7 ms 23948 KB Output is correct
8 Correct 8 ms 24208 KB Output is correct
9 Correct 7 ms 24068 KB Output is correct
10 Correct 11 ms 25692 KB Output is correct
11 Correct 6 ms 23900 KB Output is correct
12 Correct 6 ms 23900 KB Output is correct
13 Correct 6 ms 23900 KB Output is correct
14 Correct 6 ms 23900 KB Output is correct
15 Correct 6 ms 23900 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 44356 KB Output is correct
2 Correct 212 ms 43488 KB Output is correct
3 Correct 200 ms 44228 KB Output is correct
4 Correct 218 ms 44320 KB Output is correct
5 Correct 176 ms 43380 KB Output is correct
6 Correct 201 ms 45296 KB Output is correct
7 Correct 235 ms 43492 KB Output is correct
8 Correct 190 ms 43520 KB Output is correct
9 Correct 229 ms 43604 KB Output is correct
10 Correct 146 ms 43520 KB Output is correct
11 Correct 80 ms 36784 KB Output is correct
12 Correct 205 ms 43364 KB Output is correct
13 Correct 207 ms 43608 KB Output is correct
14 Correct 221 ms 43664 KB Output is correct
15 Correct 196 ms 43232 KB Output is correct
16 Correct 229 ms 43480 KB Output is correct
17 Correct 229 ms 43684 KB Output is correct
18 Correct 187 ms 43684 KB Output is correct
19 Correct 227 ms 43744 KB Output is correct
20 Correct 241 ms 43488 KB Output is correct
21 Correct 207 ms 43136 KB Output is correct
22 Correct 231 ms 43268 KB Output is correct
23 Correct 77 ms 37060 KB Output is correct
24 Correct 204 ms 43932 KB Output is correct
25 Correct 10 ms 25692 KB Output is correct
26 Correct 7 ms 24008 KB Output is correct
27 Correct 5 ms 24004 KB Output is correct
28 Correct 16 ms 27228 KB Output is correct
29 Correct 10 ms 25432 KB Output is correct
30 Correct 6 ms 23900 KB Output is correct
31 Correct 7 ms 23948 KB Output is correct
32 Correct 8 ms 24208 KB Output is correct
33 Correct 7 ms 24068 KB Output is correct
34 Correct 11 ms 25692 KB Output is correct
35 Correct 6 ms 23900 KB Output is correct
36 Correct 6 ms 23900 KB Output is correct
37 Correct 6 ms 23900 KB Output is correct
38 Correct 6 ms 23900 KB Output is correct
39 Correct 6 ms 23900 KB Output is correct
40 Correct 201 ms 44564 KB Output is correct
41 Correct 194 ms 43428 KB Output is correct
42 Correct 183 ms 43516 KB Output is correct
43 Correct 72 ms 37572 KB Output is correct
44 Correct 96 ms 37464 KB Output is correct
45 Correct 180 ms 43948 KB Output is correct
46 Correct 175 ms 43680 KB Output is correct
47 Correct 215 ms 44280 KB Output is correct
48 Correct 76 ms 36800 KB Output is correct
49 Correct 151 ms 43740 KB Output is correct
50 Correct 192 ms 43788 KB Output is correct
51 Correct 174 ms 43832 KB Output is correct