oj.uz

Submission #887668

# Submission time Handle Problem Language Result Execution time Memory
887668 2023-12-15T02:00:50 Z noobHeMan Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 266 ms 26536 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int INF = LLONG_MAX / 2;

int n, m, s, t, u, v;
const int maxN = 1e5 + 5;
vector<pair<int, int>> G[maxN];

int du[maxN], dv[maxN], ds[maxN], ans;
int dp[2][maxN];

void dijkstra1(int s, int ds[]) {
    fill(ds, ds+maxN, INF);
    ds[s] = 0;

    using T = pair<int, int>;
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.push({0, s});

    while(!pq.empty()) {
        const auto [cdist, a] = pq.top(); pq.pop();
        if(cdist != ds[a]) continue;

        for(const auto &[b, w]: G[a]) {
            if(ds[a] + w < ds[b]) {
                pq.push({ds[b] = ds[a] + w, b});
            }
        }
    }
}

void dijkstra2(int s, int e) {
    fill(ds, ds+maxN, INF);
    fill(dp[0], dp[0]+maxN, INF);
    fill(dp[1], dp[1]+maxN, INF);

    ds[s] = 0;
    dp[0][s] =  du[s], dp[1][s] =  dv[s]; 

    using T = pair<int, pair<int, int>>;
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.push({0, {s, 0}});

    while(!pq.empty()) {
        const auto [cdist, ap] = pq.top(); pq.pop();
        const auto [a, p] = ap;

        if(cdist != ds[a]) continue;

        for(const auto &[b, w]: G[a]) {
            int alt = ds[a] + w;
            if(alt == ds[b]) {
                if( min(dp[0][a], du[b]) + min(dp[1][a], dv[b]) <= dp[0][b] + dp[1][b] ) {
                    dp[0][b] = min(dp[0][a], du[b]);
                    dp[1][b] = min(dp[1][a], dv[b]);
                }
            } else if(alt < ds[b]) {
                dp[0][b] = min(du[b], dp[0][a]);
                dp[1][b] = min(dv[b], dp[1][a]);
                pq.push({ds[b] = alt, {b, a}});
            }
        }
    }

    ans = min(ans, dp[0][e] + dp[1][e]);
}

void solve() {
    cin >> n >> m >> s >> t >> u >> v;
    
    for(int i=0; i<m; i++) {
        int a, b, w;
        cin >> a >> b >> w;
        G[a].push_back({b, w});
        G[b].push_back({a, w});
    }

    dijkstra1(u, du);
    dijkstra1(v, dv);

    ans = du[v];

    dijkstra2(s, t);
    dijkstra2(t, s);

    cout << ans << "\n";
}

int32_t main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cout << fixed << setprecision(10);

    solve();

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 22984 KB Output is correct
2 Correct 197 ms 19964 KB Output is correct
3 Correct 192 ms 21640 KB Output is correct
4 Correct 197 ms 20504 KB Output is correct
5 Correct 181 ms 19696 KB Output is correct
6 Correct 203 ms 21708 KB Output is correct
7 Correct 208 ms 19916 KB Output is correct
8 Correct 190 ms 23460 KB Output is correct
9 Correct 193 ms 24136 KB Output is correct
10 Correct 155 ms 23908 KB Output is correct
11 Correct 56 ms 13780 KB Output is correct
12 Correct 201 ms 24060 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 20144 KB Output is correct
2 Correct 215 ms 19944 KB Output is correct
3 Correct 258 ms 19948 KB Output is correct
4 Correct 253 ms 19892 KB Output is correct
5 Correct 216 ms 19852 KB Output is correct
6 Correct 194 ms 19988 KB Output is correct
7 Correct 204 ms 19844 KB Output is correct
8 Correct 212 ms 19752 KB Output is correct
9 Correct 266 ms 19828 KB Output is correct
10 Correct 243 ms 20272 KB Output is correct
11 Correct 58 ms 11720 KB Output is correct
12 Correct 208 ms 20116 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8028 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 12 ms 10076 KB Output is correct
5 Correct 7 ms 8280 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 7 ms 8280 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6548 KB Output is correct
13 Correct 2 ms 6552 KB Output is correct
14 Correct 3 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 22984 KB Output is correct
2 Correct 197 ms 19964 KB Output is correct
3 Correct 192 ms 21640 KB Output is correct
4 Correct 197 ms 20504 KB Output is correct
5 Correct 181 ms 19696 KB Output is correct
6 Correct 203 ms 21708 KB Output is correct
7 Correct 208 ms 19916 KB Output is correct
8 Correct 190 ms 23460 KB Output is correct
9 Correct 193 ms 24136 KB Output is correct
10 Correct 155 ms 23908 KB Output is correct
11 Correct 56 ms 13780 KB Output is correct
12 Correct 201 ms 24060 KB Output is correct
13 Correct 205 ms 20144 KB Output is correct
14 Correct 215 ms 19944 KB Output is correct
15 Correct 258 ms 19948 KB Output is correct
16 Correct 253 ms 19892 KB Output is correct
17 Correct 216 ms 19852 KB Output is correct
18 Correct 194 ms 19988 KB Output is correct
19 Correct 204 ms 19844 KB Output is correct
20 Correct 212 ms 19752 KB Output is correct
21 Correct 266 ms 19828 KB Output is correct
22 Correct 243 ms 20272 KB Output is correct
23 Correct 58 ms 11720 KB Output is correct
24 Correct 208 ms 20116 KB Output is correct
25 Correct 7 ms 8028 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 12 ms 10076 KB Output is correct
29 Correct 7 ms 8280 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6744 KB Output is correct
34 Correct 7 ms 8280 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 2 ms 6548 KB Output is correct
37 Correct 2 ms 6552 KB Output is correct
38 Correct 3 ms 6748 KB Output is correct
39 Correct 2 ms 6748 KB Output is correct
40 Correct 197 ms 26536 KB Output is correct
41 Correct 196 ms 24096 KB Output is correct
42 Correct 204 ms 24028 KB Output is correct
43 Correct 52 ms 13904 KB Output is correct
44 Correct 53 ms 13908 KB Output is correct
45 Correct 165 ms 22764 KB Output is correct
46 Correct 164 ms 22460 KB Output is correct
47 Correct 204 ms 25652 KB Output is correct
48 Correct 65 ms 13396 KB Output is correct
49 Correct 162 ms 25436 KB Output is correct
50 Correct 170 ms 22768 KB Output is correct
51 Correct 180 ms 22672 KB Output is correct