제출 #1221094

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1221094		madamadam3	Commuter Pass (JOI18_commuter_pass)	C++20	0 / 100	2095 ms	17452 KiB

commuter_pass

#include <bits/stdc++.h>

using namespace std;

#define int long long int

using pi = pair<int, int>;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpi = vector<pi>;
using vvpi = vector<vpi>;

const int MAXN = 100'001, MAXM = 200'001;
const int INF = numeric_limits<int>::max();
int n, m, X[MAXM], Y[MAXM], C[MAXM];
int S, T, U, V;
vi adj[MAXN];

void dijkstra(int u, vi &dist, vi &par) {
    dist.assign(n+1, INF);
    par.assign(n+1, -1);

    dist[u] = 0; par[u] = 0;
    priority_queue<pi, vector<pi>, greater<pi>> q;
    q.push({0, u});

    while (!q.empty()) {
        auto cur = q.top();
        q.pop();

        int cu = cur.second, cdist = cur.first;

        for (auto &el : adj[cu]) {
            int cv = X[el] == cu ? Y[el] : X[el];
            int vdist = C[el];

            if(dist[cu] + vdist < dist[cv]) {
                par[cv] = cu;
                dist[cv] = dist[cu] + vdist;
                q.push({dist[cu] + vdist, cv});
            }
        }
    }
}

void dfs(int u, int last_edge, int cur_dist, int shortest, vb &seen, vvi &paths, vi &par) {
    if (cur_dist > shortest) return;
    if (cur_dist == shortest && u == T) {
        vi path;
        int cur = last_edge;
        while (cur != -1) {
            path.push_back(cur);
            cur = par[cur];
        }
        
        paths.push_back(path);
        return;
    }

    seen[u] = true;

    for (auto &eid : adj[u]) {
        int v = X[eid] == u ? Y[eid] : X[eid];
        int d = C[eid];

        if (seen[v]) continue;

        par[eid] = last_edge;
        dfs(v, eid, cur_dist + d, shortest, seen, paths, par);
        par[eid] = -1;
    }

    seen[u] = false;
}

signed main() {
    cin >> n >> m;
    cin >> S >> T >> U >> V;

    for (int i = 1; i <= m; i++) {
        cin >> X[i] >> Y[i] >> C[i];
        adj[X[i]].push_back(i);
        adj[Y[i]].push_back(i);
    }

    vi sd, spar;
    dijkstra(S, sd, spar);

    int shortest = sd[T];
    vvi paths; vb seen(n+1, false); vi par(m+1, -1);
    dfs(S, -1, 0, shortest, seen, paths, par);

    int best = INF;
    for (auto &path : paths) {
        vi prev_val(path.size()); 
        for (int i = 0; i < path.size(); i++) {
            prev_val[i] = C[path[i]];
            C[path[i]] = 0;
        }

        vi ud, upar;
        dijkstra(U, ud, upar);
        best = min(best, ud[V]);

        for (int i = 0; i < path.size(); i++) {
            C[path[i]] = prev_val[i];
        }
    }

    cout << best;
    return 0;
}

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