oj.uz

Submission #482587

# Submission time Handle Problem Language Result Execution time Memory
482587 2021-10-25T17:11:01 Z jalsol Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 253 ms 25264 KB 
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 1e5 + 5;

struct Link {
    int v, c;
};

struct Data {
    int u; ll du;

    bool operator<(const Data& o) const {
        return du > o.du;
    }
};

int n, ne;
int src, dest;
int U, V;
vector<Link> g[maxn];

ll ds[maxn], dU[maxn], dV[maxn];
priority_queue<Data> q;

void Dijkstra(int s, ll* d) {
    memset(d + 1, 0x3f, sizeof(ll) * n);
    d[s] = 0;
    q.push({s, d[s]});

    while (isz(q)) {
        auto [u, du] = q.top(); q.pop();
        if (du != d[u]) continue;

        Fe (&[v, c] : g[u]) {
            if (chmin(d[v], d[u] + c)) {
                q.push({v, d[v]});
            }
        }
    }
}

ll ans;
bool vis[maxn], visDest[maxn];
ll dpU[maxn], dpV[maxn];

void Dfs(int u) {
    if (vis[u]) return;
    vis[u] = true;

    dpU[u] = dpV[u] = linf;
    if (u == dest) visDest[u] = true;

    Fe (&[v, c] : g[u]) {
        if (ds[v] != ds[u] + c) continue;

        Dfs(v);
        if (visDest[v]) {
            visDest[u] = true;
            chmin(dpU[u], dpU[v]);
            chmin(dpV[u], dpV[v]);
        }
    }

    if (visDest[u]) {
        chmin(ans, dpU[u] + dV[u]);
        chmin(ans, dpV[u] + dU[u]);
        chmin(dpU[u], dU[u]);
        chmin(dpV[u], dV[u]);
    }
}

signed main() {
    cin >> n >> ne;
    cin >> src >> dest;
    cin >> U >> V;

    Rep (_, ne) {
        int u, v, c; cin >> u >> v >> c;
        g[u].push_back({v, c});
        g[v].push_back({u, c});
    }

    Dijkstra(src, ds);
    Dijkstra(U, dU);
    Dijkstra(V, dV);

    ans = dU[V];
    Dfs(src);
    cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 17900 KB Output is correct
2 Correct 212 ms 17620 KB Output is correct
3 Correct 224 ms 22772 KB Output is correct
4 Correct 198 ms 17968 KB Output is correct
5 Correct 209 ms 17436 KB Output is correct
6 Correct 221 ms 18080 KB Output is correct
7 Correct 214 ms 17596 KB Output is correct
8 Correct 214 ms 17716 KB Output is correct
9 Correct 206 ms 18080 KB Output is correct
10 Correct 172 ms 18088 KB Output is correct
11 Correct 91 ms 16448 KB Output is correct
12 Correct 222 ms 18012 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 21684 KB Output is correct
2 Correct 236 ms 21416 KB Output is correct
3 Correct 239 ms 21352 KB Output is correct
4 Correct 237 ms 21340 KB Output is correct
5 Correct 230 ms 21400 KB Output is correct
6 Correct 225 ms 22196 KB Output is correct
7 Correct 253 ms 25264 KB Output is correct
8 Correct 238 ms 21344 KB Output is correct
9 Correct 221 ms 21384 KB Output is correct
10 Correct 238 ms 21436 KB Output is correct
11 Correct 97 ms 16852 KB Output is correct
12 Correct 235 ms 22504 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3404 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 13 ms 4044 KB Output is correct
5 Correct 7 ms 3404 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 7 ms 3404 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2728 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 17900 KB Output is correct
2 Correct 212 ms 17620 KB Output is correct
3 Correct 224 ms 22772 KB Output is correct
4 Correct 198 ms 17968 KB Output is correct
5 Correct 209 ms 17436 KB Output is correct
6 Correct 221 ms 18080 KB Output is correct
7 Correct 214 ms 17596 KB Output is correct
8 Correct 214 ms 17716 KB Output is correct
9 Correct 206 ms 18080 KB Output is correct
10 Correct 172 ms 18088 KB Output is correct
11 Correct 91 ms 16448 KB Output is correct
12 Correct 222 ms 18012 KB Output is correct
13 Correct 236 ms 21684 KB Output is correct
14 Correct 236 ms 21416 KB Output is correct
15 Correct 239 ms 21352 KB Output is correct
16 Correct 237 ms 21340 KB Output is correct
17 Correct 230 ms 21400 KB Output is correct
18 Correct 225 ms 22196 KB Output is correct
19 Correct 253 ms 25264 KB Output is correct
20 Correct 238 ms 21344 KB Output is correct
21 Correct 221 ms 21384 KB Output is correct
22 Correct 238 ms 21436 KB Output is correct
23 Correct 97 ms 16852 KB Output is correct
24 Correct 235 ms 22504 KB Output is correct
25 Correct 7 ms 3404 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 13 ms 4044 KB Output is correct
29 Correct 7 ms 3404 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 3 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 7 ms 3404 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2728 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 199 ms 18392 KB Output is correct
41 Correct 215 ms 18120 KB Output is correct
42 Correct 214 ms 18164 KB Output is correct
43 Correct 95 ms 15812 KB Output is correct
44 Correct 93 ms 15856 KB Output is correct
45 Correct 206 ms 17296 KB Output is correct
46 Correct 195 ms 16948 KB Output is correct
47 Correct 201 ms 17900 KB Output is correct
48 Correct 103 ms 12912 KB Output is correct
49 Correct 166 ms 18028 KB Output is correct
50 Correct 194 ms 17360 KB Output is correct
51 Correct 194 ms 17032 KB Output is correct