oj.uz

Submission #875801

# Submission time Handle Problem Language Result Execution time Memory
875801 2023-11-20T13:57:59 Z Beerus13 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 244 ms 24112 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, int>
#define fi first
#define se second
const int ar = 1e5 + 5;
int n, m, u, v, s, t;
ll dp[ar][2], dis[ar][2], d[ar];
vector<pii> adj[ar];
ll ans = 1e18;

void dijktra(int u, int c) {
    priority_queue<pii, vector<pii>, greater<pii>> q;
    q.push({0, u});
    dp[u][c] = 0;
    while(q.size()) {
        int vt = q.top().se; ll kc = q.top().fi; q.pop();
        if(kc > dp[vt][c]) continue;
        for(auto x : adj[vt]) {
            if(dp[x.se][c] > dp[vt][c] + x.fi) {
                dp[x.se][c] = dp[vt][c] + x.fi;
                q.push({dp[x.se][c], x.se});
            }
        }
    }
}

void dijktra2(int u) {
    memset(dis, 0x3f, sizeof(dis));
    memset(d, 0x3f, sizeof(d));
    priority_queue<pii, vector<pii>, greater<pii>> q;
    q.push({0, u});
    dis[u][0] = dp[u][0];
    dis[u][1] = dp[u][1];
    d[u] = 0;
    while(q.size()) {
        int vt = q.top().se, pa = q.top().se; ll kc = q.top().fi; q.pop();
        if(kc > d[vt]) continue;
        for(auto x : adj[vt]) {
            if(d[x.se] > d[vt] + x.fi) {
                d[x.se] = d[vt] + x.fi;
                dis[x.se][0] = min(dp[x.se][0], dis[vt][0]);
                dis[x.se][1] = min(dp[x.se][1], dis[vt][1]);
                q.push({d[x.se], x.se});
            }
            else if(d[x.se] == d[vt] + x.fi) {
                if(min(dp[x.se][0], dis[vt][0]) + min(dp[x.se][1], dis[vt][1]) <= dis[x.se][0] + dis[x.se][1]) {
                    dis[x.se][0] = min(dp[x.se][0], dis[vt][0]);
                    dis[x.se][1] = min(dp[x.se][1], dis[vt][1]);
                }
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m >> s >> t >> u >> v;
    for(int i = 1; i <= m; ++i) {
        int x, y, w; cin >> x >> y >> w;
        adj[x].push_back({w, y});
        adj[y].push_back({w, x});
    }
    memset(dp, 0x3f, sizeof(dp));
    dijktra(u, 0);
    dijktra(v, 1);
    ans = dp[v][0];
    dijktra2(s);
    ans = min(ans, dis[t][0] + dis[t][1]);
    dijktra2(t);
    ans = min(ans, dis[s][0] + dis[s][1]);
    cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'void dijktra2(int)':
commuter_pass.cpp:38:30: warning: unused variable 'pa' [-Wunused-variable]
   38 |         int vt = q.top().se, pa = q.top().se; ll kc = q.top().fi; q.pop();
      |                              ^~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 24068 KB Output is correct
2 Correct 244 ms 22392 KB Output is correct
3 Correct 200 ms 23720 KB Output is correct
4 Correct 225 ms 23320 KB Output is correct
5 Correct 206 ms 22180 KB Output is correct
6 Correct 221 ms 24112 KB Output is correct
7 Correct 203 ms 22392 KB Output is correct
8 Correct 205 ms 22312 KB Output is correct
9 Correct 214 ms 23364 KB Output is correct
10 Correct 171 ms 23104 KB Output is correct
11 Correct 61 ms 13904 KB Output is correct
12 Correct 242 ms 23116 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 22696 KB Output is correct
2 Correct 214 ms 22436 KB Output is correct
3 Correct 227 ms 22664 KB Output is correct
4 Correct 218 ms 22448 KB Output is correct
5 Correct 208 ms 22436 KB Output is correct
6 Correct 213 ms 22752 KB Output is correct
7 Correct 210 ms 22260 KB Output is correct
8 Correct 214 ms 22280 KB Output is correct
9 Correct 230 ms 22900 KB Output is correct
10 Correct 216 ms 22432 KB Output is correct
11 Correct 62 ms 13908 KB Output is correct
12 Correct 225 ms 22896 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8280 KB Output is correct
2 Correct 2 ms 6756 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 13 ms 10180 KB Output is correct
5 Correct 7 ms 8280 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6888 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 2 ms 6744 KB Output is correct
10 Correct 7 ms 8284 KB Output is correct
11 Correct 2 ms 6540 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 24068 KB Output is correct
2 Correct 244 ms 22392 KB Output is correct
3 Correct 200 ms 23720 KB Output is correct
4 Correct 225 ms 23320 KB Output is correct
5 Correct 206 ms 22180 KB Output is correct
6 Correct 221 ms 24112 KB Output is correct
7 Correct 203 ms 22392 KB Output is correct
8 Correct 205 ms 22312 KB Output is correct
9 Correct 214 ms 23364 KB Output is correct
10 Correct 171 ms 23104 KB Output is correct
11 Correct 61 ms 13904 KB Output is correct
12 Correct 242 ms 23116 KB Output is correct
13 Correct 215 ms 22696 KB Output is correct
14 Correct 214 ms 22436 KB Output is correct
15 Correct 227 ms 22664 KB Output is correct
16 Correct 218 ms 22448 KB Output is correct
17 Correct 208 ms 22436 KB Output is correct
18 Correct 213 ms 22752 KB Output is correct
19 Correct 210 ms 22260 KB Output is correct
20 Correct 214 ms 22280 KB Output is correct
21 Correct 230 ms 22900 KB Output is correct
22 Correct 216 ms 22432 KB Output is correct
23 Correct 62 ms 13908 KB Output is correct
24 Correct 225 ms 22896 KB Output is correct
25 Correct 7 ms 8280 KB Output is correct
26 Correct 2 ms 6756 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 13 ms 10180 KB Output is correct
29 Correct 7 ms 8280 KB Output is correct
30 Correct 2 ms 6748 KB Output is correct
31 Correct 2 ms 6888 KB Output is correct
32 Correct 3 ms 6744 KB Output is correct
33 Correct 2 ms 6744 KB Output is correct
34 Correct 7 ms 8284 KB Output is correct
35 Correct 2 ms 6540 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6744 KB Output is correct
40 Correct 196 ms 24008 KB Output is correct
41 Correct 197 ms 23156 KB Output is correct
42 Correct 206 ms 23244 KB Output is correct
43 Correct 53 ms 13928 KB Output is correct
44 Correct 54 ms 13908 KB Output is correct
45 Correct 180 ms 22032 KB Output is correct
46 Correct 198 ms 21752 KB Output is correct
47 Correct 198 ms 23852 KB Output is correct
48 Correct 70 ms 13400 KB Output is correct
49 Correct 185 ms 23616 KB Output is correct
50 Correct 179 ms 22068 KB Output is correct
51 Correct 164 ms 21916 KB Output is correct