oj.uz

Submission #887701

# Submission time Handle Problem Language Result Execution time Memory
887701 2023-12-15T03:19:05 Z noobHeMan Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 287 ms 20176 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, 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]) {
            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});
            }
        }
    }

    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 186 ms 20160 KB Output is correct
2 Correct 194 ms 19056 KB Output is correct
3 Correct 183 ms 20176 KB Output is correct
4 Correct 215 ms 19028 KB Output is correct
5 Correct 178 ms 18832 KB Output is correct
6 Correct 200 ms 20172 KB Output is correct
7 Correct 185 ms 18940 KB Output is correct
8 Correct 188 ms 18972 KB Output is correct
9 Correct 187 ms 18888 KB Output is correct
10 Correct 227 ms 18736 KB Output is correct
11 Correct 55 ms 11856 KB Output is correct
12 Correct 194 ms 18784 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 19116 KB Output is correct
2 Correct 214 ms 19420 KB Output is correct
3 Correct 199 ms 18988 KB Output is correct
4 Correct 231 ms 18824 KB Output is correct
5 Correct 261 ms 18820 KB Output is correct
6 Correct 181 ms 18920 KB Output is correct
7 Correct 204 ms 18868 KB Output is correct
8 Correct 203 ms 18860 KB Output is correct
9 Correct 199 ms 18984 KB Output is correct
10 Correct 287 ms 19260 KB Output is correct
11 Correct 55 ms 11856 KB Output is correct
12 Correct 185 ms 18952 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 9304 KB Output is correct
5 Correct 7 ms 8024 KB Output is correct
6 Correct 2 ms 6744 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 7 ms 8028 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6788 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 186 ms 20160 KB Output is correct
2 Correct 194 ms 19056 KB Output is correct
3 Correct 183 ms 20176 KB Output is correct
4 Correct 215 ms 19028 KB Output is correct
5 Correct 178 ms 18832 KB Output is correct
6 Correct 200 ms 20172 KB Output is correct
7 Correct 185 ms 18940 KB Output is correct
8 Correct 188 ms 18972 KB Output is correct
9 Correct 187 ms 18888 KB Output is correct
10 Correct 227 ms 18736 KB Output is correct
11 Correct 55 ms 11856 KB Output is correct
12 Correct 194 ms 18784 KB Output is correct
13 Correct 212 ms 19116 KB Output is correct
14 Correct 214 ms 19420 KB Output is correct
15 Correct 199 ms 18988 KB Output is correct
16 Correct 231 ms 18824 KB Output is correct
17 Correct 261 ms 18820 KB Output is correct
18 Correct 181 ms 18920 KB Output is correct
19 Correct 204 ms 18868 KB Output is correct
20 Correct 203 ms 18860 KB Output is correct
21 Correct 199 ms 18984 KB Output is correct
22 Correct 287 ms 19260 KB Output is correct
23 Correct 55 ms 11856 KB Output is correct
24 Correct 185 ms 18952 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 9304 KB Output is correct
29 Correct 7 ms 8024 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 7 ms 8028 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 2 ms 6788 KB Output is correct
39 Correct 2 ms 6748 KB Output is correct
40 Correct 190 ms 19720 KB Output is correct
41 Correct 180 ms 18800 KB Output is correct
42 Correct 188 ms 18876 KB Output is correct
43 Correct 54 ms 11860 KB Output is correct
44 Correct 63 ms 11948 KB Output is correct
45 Correct 161 ms 18620 KB Output is correct
46 Correct 158 ms 18504 KB Output is correct
47 Correct 222 ms 20004 KB Output is correct
48 Correct 60 ms 11856 KB Output is correct
49 Correct 198 ms 19676 KB Output is correct
50 Correct 166 ms 18704 KB Output is correct
51 Correct 173 ms 18668 KB Output is correct