oj.uz

Submission #650030

# Submission time Handle Problem Language Result Execution time Memory
650030 2022-10-12T02:30:49 Z HaYoungJoon Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 394 ms 23944 KB 
#include <bits/stdc++.h>
#define ll long long
#define INF 1e18

using namespace std;

typedef pair<ll,ll> pii;
const int maxn = 1e5 + 1;
int n,m,S,T,U,V;
ll dist[2][maxn], dp[2][maxn], d[maxn];
vector<pii> adj[maxn];

void dijsktra1(int id, int s) {
    for (int i = 1; i <= n; i++) {
        dist[id][i] = INF;
    }
    dist[id][s] = 0;
    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push(pii(0,s));
    while (!pq.empty()) {
        ll u = pq.top().second, D = pq.top().first;
        pq.pop();
        if (D > dist[id][u]) continue;
        for (pii i: adj[u]) {
            int v = i.first;
            ll w = i.second;
            if (D+w < dist[id][v]) {
                dist[id][v] = D + w;
                pq.push(pii(dist[id][v],v));
            }
        }
    }
}

ll dijsktra2(int s, int f) {
    for (int i = 0; i <= n; i++) {
        d[i] = dp[0][i] = dp[1][i] = INF;
    }
    d[s] = 0;
    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push(pii(0,s));
    dp[0][s] = dist[0][s];
    dp[1][s] = dist[1][s];
    while (!pq.empty()) {
        ll u = pq.top().second, D = pq.top().first;
        pq.pop();
        if (D > d[u]) continue;
        for (pii i: adj[u]) {
            int v = i.first;
            ll w = i.second;
            if (D+w == d[v] && min(dp[0][u],dist[0][v]) + min(dp[1][u],dist[1][v]) <= dp[0][v] + dp[1][v]) {
                dp[0][v] = min(dp[0][u],dist[0][v]);
                dp[1][v] = min(dp[1][u],dist[1][v]);
            } else if (D+w < d[v]) {
                dp[0][v] = min(dp[0][u],dist[0][v]);
                dp[1][v] = min(dp[1][u],dist[1][v]);
                d[v] = D + w;
                pq.push(pii(d[v],v));
            }
        }
    }
    return dp[0][f] + dp[1][f];
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> S >> T >> U >> V;
    for (int i = 1; i <= m; i++) {
        int u,v,w;
        cin >> u >> v >> w;
        adj[u].push_back(pii(v,w));
        adj[v].push_back(pii(u,w));
    }
    dijsktra1(0,U);
    dijsktra1(1,V);
    ll res = dist[0][V];
    res = min(res,dijsktra2(S,T));
    res = min(res,dijsktra2(T,S));
    cout << res;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 20056 KB Output is correct
2 Correct 305 ms 18864 KB Output is correct
3 Correct 330 ms 19940 KB Output is correct
4 Correct 268 ms 19040 KB Output is correct
5 Correct 339 ms 18592 KB Output is correct
6 Correct 296 ms 20088 KB Output is correct
7 Correct 334 ms 18876 KB Output is correct
8 Correct 289 ms 18940 KB Output is correct
9 Correct 286 ms 18740 KB Output is correct
10 Correct 250 ms 18764 KB Output is correct
11 Correct 120 ms 11880 KB Output is correct
12 Correct 293 ms 18780 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 19016 KB Output is correct
2 Correct 345 ms 18824 KB Output is correct
3 Correct 375 ms 19040 KB Output is correct
4 Correct 322 ms 18860 KB Output is correct
5 Correct 338 ms 18840 KB Output is correct
6 Correct 321 ms 18840 KB Output is correct
7 Correct 329 ms 18916 KB Output is correct
8 Correct 394 ms 18876 KB Output is correct
9 Correct 317 ms 18948 KB Output is correct
10 Correct 377 ms 18844 KB Output is correct
11 Correct 125 ms 11812 KB Output is correct
12 Correct 283 ms 18988 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4024 KB Output is correct
2 Correct 2 ms 2692 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 16 ms 6140 KB Output is correct
5 Correct 9 ms 4360 KB Output is correct
6 Correct 2 ms 2824 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 3 ms 2952 KB Output is correct
9 Correct 3 ms 2828 KB Output is correct
10 Correct 9 ms 4356 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2692 KB Output is correct
14 Correct 4 ms 2696 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 20056 KB Output is correct
2 Correct 305 ms 18864 KB Output is correct
3 Correct 330 ms 19940 KB Output is correct
4 Correct 268 ms 19040 KB Output is correct
5 Correct 339 ms 18592 KB Output is correct
6 Correct 296 ms 20088 KB Output is correct
7 Correct 334 ms 18876 KB Output is correct
8 Correct 289 ms 18940 KB Output is correct
9 Correct 286 ms 18740 KB Output is correct
10 Correct 250 ms 18764 KB Output is correct
11 Correct 120 ms 11880 KB Output is correct
12 Correct 293 ms 18780 KB Output is correct
13 Correct 374 ms 19016 KB Output is correct
14 Correct 345 ms 18824 KB Output is correct
15 Correct 375 ms 19040 KB Output is correct
16 Correct 322 ms 18860 KB Output is correct
17 Correct 338 ms 18840 KB Output is correct
18 Correct 321 ms 18840 KB Output is correct
19 Correct 329 ms 18916 KB Output is correct
20 Correct 394 ms 18876 KB Output is correct
21 Correct 317 ms 18948 KB Output is correct
22 Correct 377 ms 18844 KB Output is correct
23 Correct 125 ms 11812 KB Output is correct
24 Correct 283 ms 18988 KB Output is correct
25 Correct 9 ms 4024 KB Output is correct
26 Correct 2 ms 2692 KB Output is correct
27 Correct 3 ms 2644 KB Output is correct
28 Correct 16 ms 6140 KB Output is correct
29 Correct 9 ms 4360 KB Output is correct
30 Correct 2 ms 2824 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 3 ms 2952 KB Output is correct
33 Correct 3 ms 2828 KB Output is correct
34 Correct 9 ms 4356 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2692 KB Output is correct
38 Correct 4 ms 2696 KB Output is correct
39 Correct 3 ms 2772 KB Output is correct
40 Correct 317 ms 23944 KB Output is correct
41 Correct 277 ms 23044 KB Output is correct
42 Correct 333 ms 23140 KB Output is correct
43 Correct 134 ms 13896 KB Output is correct
44 Correct 141 ms 13952 KB Output is correct
45 Correct 296 ms 21820 KB Output is correct
46 Correct 274 ms 21640 KB Output is correct
47 Correct 294 ms 23816 KB Output is correct
48 Correct 151 ms 13356 KB Output is correct
49 Correct 300 ms 23576 KB Output is correct
50 Correct 269 ms 21972 KB Output is correct
51 Correct 245 ms 21852 KB Output is correct