제출 #833973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833973		vjudge1	Commuter Pass (JOI18_commuter_pass)	C++17	15 / 100	2086 ms	21312 KiB

commuter_pass

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pi pair<long long, int>

const int maxn = 1e5 + 1;

int n, m, S, T, U, V, u, v, w;
vector<pi> adj[maxn];
long long d[4][maxn], miU = 1e18, miV = 1e18, res;
priority_queue< pi, vector<pi>, greater<pi> > pq;

void dijktra (int p, int pr) {
    d[p][pr] = 0;
    pq.push({0, pr});

    while (!pq.empty()) {

        long long tmp = pq.top().first;
        u = pq.top().second;
        pq.pop();

        if (tmp > d[p][u]) continue;

        for (pi x : adj[u]) {
            tie(w, v) = x;

            if (d[p][v] > d[p][u] + w)
                d[p][v] = d[p][u] + w,
                pq.push({d[p][v], v});

        }
    }
}

void dfs (int u) {
    miU = min(miU, d[2][u]);
    miV = min(miV, d[3][u]);
    if (u == T) {
        res = min(res, miU + miV);
        return ;
    }
    for (auto x : adj[u]) {
        tie(w, v) = x;
        if (d[0][u] + w + d[1][v] == d[0][T])
            dfs(v);
        if (u == S)
            miU = min(miU, d[2][u]),
            miV = min(miV, d[3][u]);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> m >> S >> T >> U >> V;
    for (int i = 1; i <= m; ++ i) {
        cin >> u >> v >> w;
        adj[u].push_back({w, v});
        adj[v].push_back({w, u});
    }

    for (int i = 1; i <= n; ++ i)
        for (int j = 0; j < 4; ++ j)
            d[j][i] = 1e17;

    dijktra(0, S);
    dijktra(1, T);
    dijktra(2, U);
    dijktra(3, V);

    res = d[2][V];
    dfs(S);
    cout << res;

    return 0;
}

• Subtask 1: 0 / 16
• Subtask 2: 15 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 45