oj.uz

Submission #375673

# Submission time Handle Problem Language Result Execution time Memory
375673 2021-03-09T16:37:55 Z valerikk Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 435 ms 22680 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const ll INF = (ll)1e18 + 100;

struct Edge {
    int a, b, c;
};

vector<ll> get_dists(int n, int st, const vector<vector<pair<int, int>>> &g) {
    vector<ll> dist(n, INF);
    dist[st] = 0;
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    auto psh = [&](int v) {
        pq.push({dist[v], v});
    };
    psh(st);
    while (!pq.empty()) {
        auto [dst, v] = pq.top();
        pq.pop();
        if (dst != dist[v]) continue;
        for (const auto& [u, w] : g[v]) {
            if (dist[v] + w < dist[u]) {
                dist[u] = dist[v] + w;
                psh(u);
            }
        }
    }
    for (int i = 0; i < n; ++i) assert(dist[i] < INF);
    return dist;
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    --s;
    --t;
    --u;
    --v;
    vector<Edge> ed(m);
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; ++i) {
        cin >> ed[i].a >> ed[i].b >> ed[i].c;
        --ed[i].a;
        --ed[i].b;
        g[ed[i].a].push_back({ed[i].b, ed[i].c});
        g[ed[i].b].push_back({ed[i].a, ed[i].c});
    }
    auto ds = get_dists(n, s, g);
    auto dt = get_dists(n, t, g);
    auto du = get_dists(n, u, g);
    auto dv = get_dists(n, v, g);
    auto slv = [&]() {
        vector<pair<ll, int>> srt;
        for (int i = 0; i < n; ++i) srt.push_back({ds[i], i});
        sort(srt.begin(), srt.end());
        vector<ll> mn(n);
        for (int i = 0; i < n; ++i) mn[i] = dv[i];
        ll ret = INF;
        for (int i = n - 1; i >= 0; --i) {
            int curv = srt[i].second;
            for (auto [curu, w] : g[curv]) {
                if (ds[curv] + dt[curu] + w == ds[t]) {
                    mn[curv] = min(mn[curv], mn[curu]);
                }
            }
            ret = min(ret, du[curv] + mn[curv]);
        }
        return ret;
    };
    ll ans = slv();
    swap(u, v);
    swap(du, dv);
    ans = min(ans, slv());
    cout << ans << endl;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 18148 KB Output is correct
2 Correct 369 ms 21744 KB Output is correct
3 Correct 391 ms 21864 KB Output is correct
4 Correct 399 ms 21936 KB Output is correct
5 Correct 396 ms 21620 KB Output is correct
6 Correct 429 ms 21888 KB Output is correct
7 Correct 433 ms 21500 KB Output is correct
8 Correct 378 ms 21680 KB Output is correct
9 Correct 407 ms 22356 KB Output is correct
10 Correct 365 ms 22488 KB Output is correct
11 Correct 189 ms 15808 KB Output is correct
12 Correct 404 ms 22444 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 18204 KB Output is correct
2 Correct 419 ms 21724 KB Output is correct
3 Correct 406 ms 21500 KB Output is correct
4 Correct 413 ms 21600 KB Output is correct
5 Correct 393 ms 21568 KB Output is correct
6 Correct 367 ms 21832 KB Output is correct
7 Correct 403 ms 21624 KB Output is correct
8 Correct 404 ms 21596 KB Output is correct
9 Correct 430 ms 21696 KB Output is correct
10 Correct 425 ms 21748 KB Output is correct
11 Correct 215 ms 15936 KB Output is correct
12 Correct 435 ms 21784 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1388 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 17 ms 3052 KB Output is correct
5 Correct 9 ms 1644 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 9 ms 1644 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 18148 KB Output is correct
2 Correct 369 ms 21744 KB Output is correct
3 Correct 391 ms 21864 KB Output is correct
4 Correct 399 ms 21936 KB Output is correct
5 Correct 396 ms 21620 KB Output is correct
6 Correct 429 ms 21888 KB Output is correct
7 Correct 433 ms 21500 KB Output is correct
8 Correct 378 ms 21680 KB Output is correct
9 Correct 407 ms 22356 KB Output is correct
10 Correct 365 ms 22488 KB Output is correct
11 Correct 189 ms 15808 KB Output is correct
12 Correct 404 ms 22444 KB Output is correct
13 Correct 414 ms 18204 KB Output is correct
14 Correct 419 ms 21724 KB Output is correct
15 Correct 406 ms 21500 KB Output is correct
16 Correct 413 ms 21600 KB Output is correct
17 Correct 393 ms 21568 KB Output is correct
18 Correct 367 ms 21832 KB Output is correct
19 Correct 403 ms 21624 KB Output is correct
20 Correct 404 ms 21596 KB Output is correct
21 Correct 430 ms 21696 KB Output is correct
22 Correct 425 ms 21748 KB Output is correct
23 Correct 215 ms 15936 KB Output is correct
24 Correct 435 ms 21784 KB Output is correct
25 Correct 9 ms 1388 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 17 ms 3052 KB Output is correct
29 Correct 9 ms 1644 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 3 ms 620 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 9 ms 1644 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 378 ms 21992 KB Output is correct
41 Correct 434 ms 22272 KB Output is correct
42 Correct 392 ms 22680 KB Output is correct
43 Correct 169 ms 15936 KB Output is correct
44 Correct 197 ms 15936 KB Output is correct
45 Correct 347 ms 21516 KB Output is correct
46 Correct 375 ms 21268 KB Output is correct
47 Correct 368 ms 21892 KB Output is correct
48 Correct 195 ms 15296 KB Output is correct
49 Correct 350 ms 21476 KB Output is correct
50 Correct 357 ms 21632 KB Output is correct
51 Correct 382 ms 21712 KB Output is correct