oj.uz

Submission #392533

# Submission time Handle Problem Language Result Execution time Memory
392533 2021-04-21T09:52:50 Z palilo Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 356 ms 18552 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int64_t INF = 0x3f3f3f3f3f3f3f3f;

struct min_heap_elem {
    int64_t d;
    int u;
    min_heap_elem(int64_t d, int u) : d(d), u(u) {}
    bool operator<(const min_heap_elem& rhs) const {
        return d > rhs.d;
    }
};

struct max_heap_elem {
    int64_t d;
    int u;
    max_heap_elem(int64_t d, int u) : d(d), u(u) {}
    bool operator<(const max_heap_elem& rhs) const {
        return d < rhs.d;
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef home
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int n, m, s, t, m1, m2;
    cin >> n >> m >> s >> t >> m1 >> m2;
    --s, --t, --m1, --m2;

    vector<vector<pair<int, int>>> adj(n);
    for (int u, v, w; m--;) {
        cin >> u >> v >> w, --u, --v;
        adj[u].emplace_back(w, v);
        adj[v].emplace_back(w, u);
    }

    auto dijk = [&](int src) {
        vector<int64_t> dist(n, INF);

        priority_queue<min_heap_elem> pq;
        pq.emplace(dist[src] = 0, src);

        while (!pq.empty()) {
            const auto [d, u] = pq.top();
            pq.pop();

            if (d != dist[u]) continue;

            for (const auto& [w, v] : adj[u])
                if (dist[v] > d + w)
                    pq.emplace(dist[v] = d + w, v);
        }
        return dist;
    };

    auto dist = dijk(s);
    auto dist_from_u = dijk(m1), dist_from_v = dijk(m2);

    auto rev_ord = [&]() {
        vector<bool> visited(n);
        visited[t] = true;

        priority_queue<max_heap_elem> pq;
        pq.emplace(dist[t], t);

        vector<int> vtx;
        while (!pq.empty()) {
            const auto [d, v] = pq.top();
            pq.pop();

            vtx.emplace_back(v);
            auto it = remove_if(adj[v].begin(), adj[v].end(), [&](auto& edge) {
                auto& [w, u] = edge;
                if (d != dist[u] + w) {
                    return true;
                }
                if (!visited[u]) {
                    visited[u] = true;
                    pq.emplace(dist[u], u);
                }
                return false;
            });
            adj[v].erase(it, adj[v].end());
        }
        return vtx;
    }();

    assert(rev_ord.front() == t);
    assert(rev_ord.back() == s);
    assert(adj[s].empty());

    auto solve = [&](const vector<int64_t>& dp1, vector<int64_t>&& dp2) {
        for (const auto& v : rev_ord)
            for (const auto& [w, u] : adj[v])
                dp2[u] = min(dp2[u], dp2[v]);

        int64_t ret = INT64_MAX;
        for (int i = 0; i < n; ++i)
            ret = min(ret, dp1[i] + dp2[i]);
        return ret;
    };

    cout << min(solve(dist_from_u, vector<int64_t>(dist_from_v)),
                solve(dist_from_v, vector<int64_t>(dist_from_u)));
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 15400 KB Output is correct
2 Correct 265 ms 14140 KB Output is correct
3 Correct 313 ms 14208 KB Output is correct
4 Correct 250 ms 14820 KB Output is correct
5 Correct 260 ms 13892 KB Output is correct
6 Correct 259 ms 15092 KB Output is correct
7 Correct 282 ms 13888 KB Output is correct
8 Correct 300 ms 16740 KB Output is correct
9 Correct 263 ms 17436 KB Output is correct
10 Correct 248 ms 17332 KB Output is correct
11 Correct 100 ms 11968 KB Output is correct
12 Correct 269 ms 17400 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 14284 KB Output is correct
2 Correct 356 ms 14172 KB Output is correct
3 Correct 272 ms 14240 KB Output is correct
4 Correct 279 ms 14188 KB Output is correct
5 Correct 275 ms 14272 KB Output is correct
6 Correct 269 ms 14232 KB Output is correct
7 Correct 284 ms 14588 KB Output is correct
8 Correct 297 ms 14128 KB Output is correct
9 Correct 324 ms 14196 KB Output is correct
10 Correct 276 ms 14152 KB Output is correct
11 Correct 110 ms 11032 KB Output is correct
12 Correct 269 ms 14284 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 15 ms 2380 KB Output is correct
5 Correct 8 ms 1280 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 404 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 11 ms 1356 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 15400 KB Output is correct
2 Correct 265 ms 14140 KB Output is correct
3 Correct 313 ms 14208 KB Output is correct
4 Correct 250 ms 14820 KB Output is correct
5 Correct 260 ms 13892 KB Output is correct
6 Correct 259 ms 15092 KB Output is correct
7 Correct 282 ms 13888 KB Output is correct
8 Correct 300 ms 16740 KB Output is correct
9 Correct 263 ms 17436 KB Output is correct
10 Correct 248 ms 17332 KB Output is correct
11 Correct 100 ms 11968 KB Output is correct
12 Correct 269 ms 17400 KB Output is correct
13 Correct 292 ms 14284 KB Output is correct
14 Correct 356 ms 14172 KB Output is correct
15 Correct 272 ms 14240 KB Output is correct
16 Correct 279 ms 14188 KB Output is correct
17 Correct 275 ms 14272 KB Output is correct
18 Correct 269 ms 14232 KB Output is correct
19 Correct 284 ms 14588 KB Output is correct
20 Correct 297 ms 14128 KB Output is correct
21 Correct 324 ms 14196 KB Output is correct
22 Correct 276 ms 14152 KB Output is correct
23 Correct 110 ms 11032 KB Output is correct
24 Correct 269 ms 14284 KB Output is correct
25 Correct 8 ms 1364 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 15 ms 2380 KB Output is correct
29 Correct 8 ms 1280 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 404 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 11 ms 1356 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 320 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 238 ms 18552 KB Output is correct
41 Correct 252 ms 17444 KB Output is correct
42 Correct 246 ms 17376 KB Output is correct
43 Correct 126 ms 12316 KB Output is correct
44 Correct 137 ms 12472 KB Output is correct
45 Correct 282 ms 17252 KB Output is correct
46 Correct 319 ms 16908 KB Output is correct
47 Correct 250 ms 18100 KB Output is correct
48 Correct 130 ms 11752 KB Output is correct
49 Correct 212 ms 18212 KB Output is correct
50 Correct 279 ms 16640 KB Output is correct
51 Correct 278 ms 17272 KB Output is correct