oj.uz

Submission #963084

# Submission time Handle Problem Language Result Execution time Memory
963084 2024-04-14T13:34:15 Z toast12 Commuter Pass (JOI18_commuter_pass) C++14
0 / 100
 357 ms 30236 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e15;

int n, m;
int s, t, u, v;
vector<vector<pair<int, long long>>> adj;
vector<vector<int>> p;
set<int> path;
vector<bool> processed;

void path_finder(int start) {
    if (processed[start])
        return;
    path.insert(start);
    if (start == s) 
        return;
    for (auto x : p[start]) {
        path_finder(x);
    }
    processed[start] = true;
}

void dijkstras(vector<vector<int>> &parent, vector<long long> &dist, int start) {
    priority_queue<pair<int, int>> pq;
    pq.push({0, start});
    while (!pq.empty()) {
        int x = pq.top().second;
        pq.pop();
        for (auto e : adj[x]) {
            long long w = e.second;
            if (w + dist[x] < dist[e.first]) {
                parent[e.first].push_back(x);
                dist[e.first] = dist[x]+w;
                pq.push({-dist[e.first], e.first});
            }
        }
    }
}

int main() {
    cin >> n >> m;
    adj.resize(n+1);
    p.resize(n+1);
    processed.resize(n+1);
    cin >> s >> t >> u >> v;
    for (int i = 0; i < m; i++) {
        int x, y;
        long long w;
        cin >> x >> y >> w;
        adj[x].push_back({y, w});
        adj[y].push_back({x, w});
    }
    p[s].push_back(s);
    vector<long long> d(n+1, INF);
    d[s] = 0;
    dijkstras(p, d, s);
    for (auto x : p[t]) {
        path_finder(x);
    }
    vector<vector<int>> temp(n+1);
    vector<long long> dv(n+1, INF);
    dv[v] = 0;
    dijkstras(temp, dv, v);
    long long ans = INF;
    long long mnv = INF;
    for (auto node : path) {
        mnv = min(mnv, dv[node]);
        ans = min(ans, mnv);
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 25484 KB Output is correct
2 Correct 273 ms 25420 KB Output is correct
3 Incorrect 332 ms 30236 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 345 ms 26832 KB Output is correct
2 Incorrect 357 ms 27592 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 25484 KB Output is correct
2 Correct 273 ms 25420 KB Output is correct
3 Incorrect 332 ms 30236 KB Output isn't correct
4 Halted 0 ms 0 KB -