Submission #834691

#	Time	Username	Problem	Language	Result	Execution time	Memory
834691		vjudge1	Commuter Pass (JOI18_commuter_pass)	C++17	31 / 100	270 ms	24132 KiB

commuter_pass

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

#define task "code"
#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[maxn], miV[maxn], res;
priority_queue< pi, vector<pi>, greater<pi> > pq;
bool vs[maxn];

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[u] = d[2][u];
    miV[u] = d[3][u];
    vs[u] = 1;
    for (auto x : adj[u]) {
        tie(w, v) = x;
        if (d[0][u] + w + d[1][v] == d[0][T] && !vs[v])
            dfs(v);
    }
    for (auto x : adj[u]) {
        v = x.second;
        miU[u] = min(miU[u], miU[v]);
        miV[u] = min(miV[u], miV[v]);
    }
    res = min(res, miU[u] + miV[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});
    }

    memset(d, 0x3f, sizeof d);

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

    res = d[2][V];
    memset(miU, 0x3f, sizeof miU);
    memset(miV, 0x3f, sizeof miV);
    dfs(S);
    cout << res;

    return 0;
}

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