oj.uz

Submission #501191

# Submission time Handle Problem Language Result Execution time Memory
501191 2022-01-02T15:06:59 Z radal Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 585 ms 25144 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2,fma")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
const long long int N = 1e5+20,mod = 1e9+7,inf = 1e18+10,sq = 32000;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
inline int poww(int n,int k){
    int c = 1;
    while (k){
        if (k&1) c = (1ll*c*n)%mod;
        n = (1ll*n*n)%mod;
        k >>= 1;
    }
    return c;
}
ll d[4][N],my[N],mx[N];
int par[4][N];
int s,t,x,y;
vector<pll> adj[N];
void dij(int i){
    set<pair<ll,int> > st;
    if (i == 0){
        st.insert({0,s});
        d[0][s] = 0;
        par[0][s] = -1;
        my[s] = d[3][s];
        mx[s] = d[2][s];
    }
    if (i == 1){
        st.insert({0,t});
        d[1][t] = 0;
        par[1][t] = -1;
    }
    if (i == 2){
        st.insert({0,x});
        d[2][x] = 0;
        par[2][x] = -1;
    }
    if (i == 3){
        st.insert({0,y});
        d[3][y] = 0;
        par[3][y] = -1;
    }
    while (!st.empty()){
        auto p = *(st.begin());
        int v = p.Y;
        st.erase(st.begin());
        for (auto u : adj[v]){
            if (d[i][u.X] > d[i][v] + u.Y){
                st.erase({d[i][u.X],u.X});
                par[i][u.X] = v;
                if (!i){
                    my[u.X] = d[3][u.X];
                    mx[u.X] = d[2][u.X];
                }
                d[i][u.X] = d[i][v] + u.Y;
                st.insert({d[i][u.X],u.X});
            }
            if (!i && d[i][u.X] == d[i][v] + u.Y){
                my[u.X] = min(my[u.X],my[v]);
                mx[u.X] = min(mx[u.X],mx[v]);
            }
        }
    }
}
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    memset(d,63,sizeof d);
    int n,m;
    cin >> n >> m >> s >> t  >> x >> y;
    rep(i,0,m){
        ll u,v,w;
        cin >> u >> v >> w;
        adj[u].pb({v,w});
        adj[v].pb({u,w});
    }
    repr(i,3,0) dij(i);
    ll ans = d[2][y];
    rep(i,1,n+1){
        if(d[0][i]+d[1][i] == d[0][t]) ans = min({ans,my[i]+d[2][i],mx[i]+d[3][i]});
    }
    cout << ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 22192 KB Output is correct
2 Correct 385 ms 20796 KB Output is correct
3 Correct 371 ms 20956 KB Output is correct
4 Correct 412 ms 22084 KB Output is correct
5 Correct 376 ms 20800 KB Output is correct
6 Correct 451 ms 22116 KB Output is correct
7 Correct 401 ms 20748 KB Output is correct
8 Correct 374 ms 20804 KB Output is correct
9 Correct 392 ms 21732 KB Output is correct
10 Correct 306 ms 21912 KB Output is correct
11 Correct 107 ms 13984 KB Output is correct
12 Correct 407 ms 21352 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 21240 KB Output is correct
2 Correct 416 ms 20536 KB Output is correct
3 Correct 393 ms 20396 KB Output is correct
4 Correct 398 ms 20420 KB Output is correct
5 Correct 400 ms 20452 KB Output is correct
6 Correct 356 ms 20836 KB Output is correct
7 Correct 407 ms 20548 KB Output is correct
8 Correct 401 ms 20484 KB Output is correct
9 Correct 395 ms 20460 KB Output is correct
10 Correct 416 ms 20504 KB Output is correct
11 Correct 104 ms 14072 KB Output is correct
12 Correct 343 ms 20788 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6860 KB Output is correct
2 Correct 3 ms 5836 KB Output is correct
3 Correct 3 ms 5804 KB Output is correct
4 Correct 15 ms 7856 KB Output is correct
5 Correct 10 ms 6840 KB Output is correct
6 Correct 4 ms 5820 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 5 ms 5988 KB Output is correct
9 Correct 4 ms 5820 KB Output is correct
10 Correct 9 ms 6824 KB Output is correct
11 Correct 3 ms 5836 KB Output is correct
12 Correct 3 ms 5816 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 3 ms 5836 KB Output is correct
15 Correct 3 ms 5836 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 22192 KB Output is correct
2 Correct 385 ms 20796 KB Output is correct
3 Correct 371 ms 20956 KB Output is correct
4 Correct 412 ms 22084 KB Output is correct
5 Correct 376 ms 20800 KB Output is correct
6 Correct 451 ms 22116 KB Output is correct
7 Correct 401 ms 20748 KB Output is correct
8 Correct 374 ms 20804 KB Output is correct
9 Correct 392 ms 21732 KB Output is correct
10 Correct 306 ms 21912 KB Output is correct
11 Correct 107 ms 13984 KB Output is correct
12 Correct 407 ms 21352 KB Output is correct
13 Correct 413 ms 21240 KB Output is correct
14 Correct 416 ms 20536 KB Output is correct
15 Correct 393 ms 20396 KB Output is correct
16 Correct 398 ms 20420 KB Output is correct
17 Correct 400 ms 20452 KB Output is correct
18 Correct 356 ms 20836 KB Output is correct
19 Correct 407 ms 20548 KB Output is correct
20 Correct 401 ms 20484 KB Output is correct
21 Correct 395 ms 20460 KB Output is correct
22 Correct 416 ms 20504 KB Output is correct
23 Correct 104 ms 14072 KB Output is correct
24 Correct 343 ms 20788 KB Output is correct
25 Correct 9 ms 6860 KB Output is correct
26 Correct 3 ms 5836 KB Output is correct
27 Correct 3 ms 5804 KB Output is correct
28 Correct 15 ms 7856 KB Output is correct
29 Correct 10 ms 6840 KB Output is correct
30 Correct 4 ms 5820 KB Output is correct
31 Correct 4 ms 5964 KB Output is correct
32 Correct 5 ms 5988 KB Output is correct
33 Correct 4 ms 5820 KB Output is correct
34 Correct 9 ms 6824 KB Output is correct
35 Correct 3 ms 5836 KB Output is correct
36 Correct 3 ms 5816 KB Output is correct
37 Correct 3 ms 5836 KB Output is correct
38 Correct 3 ms 5836 KB Output is correct
39 Correct 3 ms 5836 KB Output is correct
40 Correct 585 ms 25144 KB Output is correct
41 Correct 399 ms 21628 KB Output is correct
42 Correct 384 ms 21632 KB Output is correct
43 Correct 104 ms 14108 KB Output is correct
44 Correct 128 ms 14120 KB Output is correct
45 Correct 276 ms 20400 KB Output is correct
46 Correct 262 ms 20164 KB Output is correct
47 Correct 427 ms 21952 KB Output is correct
48 Correct 118 ms 13588 KB Output is correct
49 Correct 359 ms 24752 KB Output is correct
50 Correct 315 ms 20372 KB Output is correct
51 Correct 314 ms 20404 KB Output is correct