oj.uz

Submission #884066

# Submission time Handle Problem Language Result Execution time Memory
884066 2023-12-06T15:23:08 Z Sharky Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 288 ms 39472 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int INF = 1e18;

struct edge {
    int u, v, w;
};

int n, ans;
vector<vector<pair<int, int>>> adj(100005);
vector<vector<int>> g(100005), g2(100005);
vector<int> du(100005), dv(100005);
vector<int> deg1(100005, 0), deg2(100005, 0);
vector<edge> edges;

void dijk(int s, vector<int>& di, vector<vector<pair<int, int>>>& G) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
    for (int i = 1; i <= n; i++) di[i] = INF;
    di[s] = 0;
    q.push({di[s], s});
    while (!q.empty()) {
        auto [d, u] = q.top();
        q.pop();
        if (di[u] != d) continue;
        for (auto& [v, w] : G[u]) {
            if (di[u] + w < di[v]) {
                di[v] = di[u] + w;
                q.push({di[v], v});
            }
        }
    }
}

void dijk2(vector<int>& dp, vector<vector<int>>& G, vector<int>& deg) {
    queue<int> q;
    vector<int> di(n + 1);
    for (int i = 1; i <= n; i++) {
        di[i] = du[i];
        if (!deg[i]) q.push(i);
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        // cout << u << '\n';
        ans = min(ans, di[u] + dv[u]);
        for (auto& v : G[u]) {
            deg[v]--;
            di[v] = min(di[v], di[u]);
            if (deg[v] == 0) q.push(v);
        }
    }
}

int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    while (m--) {
        int x, y, w;
        cin >> x >> y >> w;
        edges.push_back({x, y, w});
        adj[x].push_back({y, w});
        adj[y].push_back({x, w});
    }
    vector<int> ds(n+1), dt(n+1), dp(n+1), dp2(n+1);
    dijk(s, ds, adj); dijk(t, dt, adj); dijk(u, du, adj); dijk(v, dv, adj);
    vector<bool> nodes(n+1, 0);
    for (int i = 1; i <= n; i++) if (ds[i] + dt[i] == ds[t]) nodes[i] = 1;
    for (auto& [x, y, w] : edges) {
        if (ds[x] + dt[y] + w == ds[t]) {
            g[x].push_back(y);
            g2[y].push_back(x);
            deg1[y]++, deg2[x]++;
            // cout << x << ' ' << y << '\n';
        } else if (ds[y] + dt[x] + w == ds[t]) {
            g[y].push_back(x);
            g2[x].push_back(y);
            deg1[x]++, deg2[y]++;
            // cout << x << " " << y << '\n';
        }
    }
    ans = du[v];
    dijk2(dp, g, deg1); dijk2(dp2, g2, deg2);
    cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 33240 KB Output is correct
2 Correct 269 ms 31628 KB Output is correct
3 Correct 229 ms 34296 KB Output is correct
4 Correct 193 ms 32952 KB Output is correct
5 Correct 281 ms 33784 KB Output is correct
6 Correct 219 ms 33176 KB Output is correct
7 Correct 255 ms 34300 KB Output is correct
8 Correct 247 ms 32524 KB Output is correct
9 Correct 286 ms 30456 KB Output is correct
10 Correct 171 ms 31000 KB Output is correct
11 Correct 86 ms 24940 KB Output is correct
12 Correct 234 ms 31540 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 32428 KB Output is correct
2 Correct 243 ms 32224 KB Output is correct
3 Correct 237 ms 31300 KB Output is correct
4 Correct 261 ms 32664 KB Output is correct
5 Correct 240 ms 31852 KB Output is correct
6 Correct 270 ms 34052 KB Output is correct
7 Correct 249 ms 33272 KB Output is correct
8 Correct 288 ms 31740 KB Output is correct
9 Correct 245 ms 32248 KB Output is correct
10 Correct 227 ms 31792 KB Output is correct
11 Correct 108 ms 26372 KB Output is correct
12 Correct 263 ms 33524 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12560 KB Output is correct
2 Correct 4 ms 10588 KB Output is correct
3 Correct 4 ms 10588 KB Output is correct
4 Correct 16 ms 14352 KB Output is correct
5 Correct 10 ms 12308 KB Output is correct
6 Correct 4 ms 10588 KB Output is correct
7 Correct 5 ms 10844 KB Output is correct
8 Correct 6 ms 10924 KB Output is correct
9 Correct 5 ms 10584 KB Output is correct
10 Correct 10 ms 12820 KB Output is correct
11 Correct 4 ms 10588 KB Output is correct
12 Correct 4 ms 10588 KB Output is correct
13 Correct 5 ms 10660 KB Output is correct
14 Correct 5 ms 10624 KB Output is correct
15 Correct 6 ms 10584 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 33240 KB Output is correct
2 Correct 269 ms 31628 KB Output is correct
3 Correct 229 ms 34296 KB Output is correct
4 Correct 193 ms 32952 KB Output is correct
5 Correct 281 ms 33784 KB Output is correct
6 Correct 219 ms 33176 KB Output is correct
7 Correct 255 ms 34300 KB Output is correct
8 Correct 247 ms 32524 KB Output is correct
9 Correct 286 ms 30456 KB Output is correct
10 Correct 171 ms 31000 KB Output is correct
11 Correct 86 ms 24940 KB Output is correct
12 Correct 234 ms 31540 KB Output is correct
13 Correct 248 ms 32428 KB Output is correct
14 Correct 243 ms 32224 KB Output is correct
15 Correct 237 ms 31300 KB Output is correct
16 Correct 261 ms 32664 KB Output is correct
17 Correct 240 ms 31852 KB Output is correct
18 Correct 270 ms 34052 KB Output is correct
19 Correct 249 ms 33272 KB Output is correct
20 Correct 288 ms 31740 KB Output is correct
21 Correct 245 ms 32248 KB Output is correct
22 Correct 227 ms 31792 KB Output is correct
23 Correct 108 ms 26372 KB Output is correct
24 Correct 263 ms 33524 KB Output is correct
25 Correct 10 ms 12560 KB Output is correct
26 Correct 4 ms 10588 KB Output is correct
27 Correct 4 ms 10588 KB Output is correct
28 Correct 16 ms 14352 KB Output is correct
29 Correct 10 ms 12308 KB Output is correct
30 Correct 4 ms 10588 KB Output is correct
31 Correct 5 ms 10844 KB Output is correct
32 Correct 6 ms 10924 KB Output is correct
33 Correct 5 ms 10584 KB Output is correct
34 Correct 10 ms 12820 KB Output is correct
35 Correct 4 ms 10588 KB Output is correct
36 Correct 4 ms 10588 KB Output is correct
37 Correct 5 ms 10660 KB Output is correct
38 Correct 5 ms 10624 KB Output is correct
39 Correct 6 ms 10584 KB Output is correct
40 Correct 199 ms 35780 KB Output is correct
41 Correct 215 ms 35324 KB Output is correct
42 Correct 214 ms 35572 KB Output is correct
43 Correct 110 ms 30164 KB Output is correct
44 Correct 97 ms 30096 KB Output is correct
45 Correct 248 ms 39472 KB Output is correct
46 Correct 249 ms 39448 KB Output is correct
47 Correct 258 ms 36344 KB Output is correct
48 Correct 101 ms 30204 KB Output is correct
49 Correct 169 ms 35972 KB Output is correct
50 Correct 224 ms 39092 KB Output is correct
51 Correct 247 ms 39416 KB Output is correct