oj.uz

Submission #944281

# Submission time Handle Problem Language Result Execution time Memory
944281 2024-03-12T13:56:51 Z GasmaskChan Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 250 ms 40084 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define MAX 100007

int f[MAX];
vector<pair<int, int>> g[MAX];
vector<int> fu, fv, par[MAX], ng[MAX];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;

bool indag[MAX];
void dfs(int u)
{
    indag[u] = true;
    for (int v : par[u])
    {
        ng[v].push_back(u);
        if (!indag[v]) dfs(v);
    }
}

vector<int> topo;
bool visited[MAX];
void toposort(int u)
{
    visited[u] = true;
    for (int v : ng[u]) if (!visited[v]) toposort(v);
    topo.push_back(u);
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout);
    int n, m, s, t, st, ed;
    cin >> n >> m >> s >> t >> st >> ed;
    while (m--)
    {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }

    auto dij = [&](int start, vector<int> &cur) {
        cur.assign(n + 2, 1e18);
        cur[start] = 0;
        q.emplace(0, start);
        while (!q.empty())
        {
            int w, u;
            tie(w, u) = q.top();
            q.pop();

            if (cur[u] != w) continue;
            for (auto [v, c] : g[u])
                if (cur[u] + c < cur[v]) q.emplace(cur[v] = cur[u] + c, v);
        }
    };

    dij(st, fu); dij(ed, fv);

    int ans = fu[ed];

    memset(f, 0x3f, sizeof f);
    f[s] = 0;
    q.emplace(0, s);
    while (!q.empty())
    {
        int w, u;
        tie(w, u) = q.top();
        q.pop();

        if (f[u] != w) continue;
        for (auto [v, c] : g[u])
            if (f[u] + c < f[v]) par[v] = {u}, q.emplace(f[v] = f[u] + c, v);
            else if (f[u] + c == f[v]) par[v].push_back(u);
    }

    dfs(t);

    vector<vector<int>> dp(n + 2, vector<int>(2, 1e18));
    toposort(s);
    std::reverse(topo.begin(), topo.end());

    for (int i = 1; i <= n; i++)
    {
        dp[i][0] = fu[i];
        dp[i][1] = fv[i];
    }

    for (int u : topo)
        for (int v : ng[u])
        {
            dp[v][0] = min(dp[v][0], dp[u][0]);
            dp[v][1] = min(dp[v][1], dp[u][1]);
        }

    for (int i = 1; i <= n; i++) if (indag[i]) ans = min({ans, dp[i][0] + fv[i], dp[i][1] + fu[i]});

    cout << ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 31444 KB Output is correct
2 Correct 248 ms 32844 KB Output is correct
3 Correct 242 ms 40084 KB Output is correct
4 Correct 203 ms 31692 KB Output is correct
5 Correct 227 ms 34044 KB Output is correct
6 Correct 203 ms 31616 KB Output is correct
7 Correct 211 ms 34248 KB Output is correct
8 Correct 200 ms 34240 KB Output is correct
9 Correct 185 ms 31400 KB Output is correct
10 Correct 156 ms 31232 KB Output is correct
11 Correct 81 ms 29904 KB Output is correct
12 Correct 206 ms 31548 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 35028 KB Output is correct
2 Correct 221 ms 35080 KB Output is correct
3 Correct 202 ms 34504 KB Output is correct
4 Correct 250 ms 35236 KB Output is correct
5 Correct 220 ms 36080 KB Output is correct
6 Correct 217 ms 38856 KB Output is correct
7 Correct 214 ms 40032 KB Output is correct
8 Correct 208 ms 35188 KB Output is correct
9 Correct 205 ms 36088 KB Output is correct
10 Correct 212 ms 34708 KB Output is correct
11 Correct 84 ms 32224 KB Output is correct
12 Correct 212 ms 39128 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 10072 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 15 ms 11784 KB Output is correct
5 Correct 7 ms 9820 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 3 ms 8280 KB Output is correct
10 Correct 7 ms 10328 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8320 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 31444 KB Output is correct
2 Correct 248 ms 32844 KB Output is correct
3 Correct 242 ms 40084 KB Output is correct
4 Correct 203 ms 31692 KB Output is correct
5 Correct 227 ms 34044 KB Output is correct
6 Correct 203 ms 31616 KB Output is correct
7 Correct 211 ms 34248 KB Output is correct
8 Correct 200 ms 34240 KB Output is correct
9 Correct 185 ms 31400 KB Output is correct
10 Correct 156 ms 31232 KB Output is correct
11 Correct 81 ms 29904 KB Output is correct
12 Correct 206 ms 31548 KB Output is correct
13 Correct 214 ms 35028 KB Output is correct
14 Correct 221 ms 35080 KB Output is correct
15 Correct 202 ms 34504 KB Output is correct
16 Correct 250 ms 35236 KB Output is correct
17 Correct 220 ms 36080 KB Output is correct
18 Correct 217 ms 38856 KB Output is correct
19 Correct 214 ms 40032 KB Output is correct
20 Correct 208 ms 35188 KB Output is correct
21 Correct 205 ms 36088 KB Output is correct
22 Correct 212 ms 34708 KB Output is correct
23 Correct 84 ms 32224 KB Output is correct
24 Correct 212 ms 39128 KB Output is correct
25 Correct 8 ms 10072 KB Output is correct
26 Correct 3 ms 8284 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 15 ms 11784 KB Output is correct
29 Correct 7 ms 9820 KB Output is correct
30 Correct 3 ms 8284 KB Output is correct
31 Correct 3 ms 8284 KB Output is correct
32 Correct 3 ms 8540 KB Output is correct
33 Correct 3 ms 8280 KB Output is correct
34 Correct 7 ms 10328 KB Output is correct
35 Correct 2 ms 8284 KB Output is correct
36 Correct 2 ms 8284 KB Output is correct
37 Correct 2 ms 8284 KB Output is correct
38 Correct 2 ms 8284 KB Output is correct
39 Correct 2 ms 8320 KB Output is correct
40 Correct 181 ms 31896 KB Output is correct
41 Correct 188 ms 31568 KB Output is correct
42 Correct 189 ms 31536 KB Output is correct
43 Correct 106 ms 32956 KB Output is correct
44 Correct 92 ms 32972 KB Output is correct
45 Correct 242 ms 36624 KB Output is correct
46 Correct 218 ms 36600 KB Output is correct
47 Correct 204 ms 31944 KB Output is correct
48 Correct 91 ms 29896 KB Output is correct
49 Correct 175 ms 32072 KB Output is correct
50 Correct 213 ms 36040 KB Output is correct
51 Correct 200 ms 36616 KB Output is correct