oj.uz

Submission #519423

# Submission time Handle Problem Language Result Execution time Memory
519423 2022-01-26T10:46:57 Z Jarif_Rahman Commuter Pass (JOI18_commuter_pass) C++17
0 / 100
 2000 ms 55980 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const ll inf = 1e17;

vector<ll> dijsktra(vector<vector<pair<int, ll>>> v, int s){
    int n = v.size();

    vector<ll> dis(n, inf);
    vector<bool> bl(n, 0);
    priority_queue<pair<ll, int>> pq;

    dis[s] = 0;
    pq.push({0, s});

    while(!pq.empty()){
        int nd = pq.top().sc;
        pq.pop();
        if(bl[nd]) continue;
        bl[nd] = 1;

        for(auto [x, w]: v[nd]) if(dis[nd]+w < dis[x]){
            dis[x] = dis[nd]+w;
            pq.push({-dis[x], x});
        }
    }

    return dis;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m; cin >> n >> m;
    int S, T, U, V; cin >> S >> T >> U >> V; S--, T--, U--, V--;

    vector<vector<pair<int, ll>>> v(n);

    for(int i = 0; i < m; i++){
        int a, b; ll w; cin >> a >> b >> w; a--, b--;
        v[a].pb({b, w});
        v[b].pb({a, w});
    }

    vector<ll> ds = dijsktra(v, S), dt = dijsktra(v, T), du = dijsktra(v, U), dv = dijsktra(v, V);

    ll ans = du[V];

    vector<vector<ll>> d(n);
    for(int i = 0; i < n; i++) d[i] = dijsktra(v, i);

    for(int i = 0; i < n; i++) for(int j = i; j < n; j++){
        if(ds[i]+d[i][j]+dt[j] == ds[T]) ans = min(ans, min(du[i]+dv[j], du[j]+dv[i]));
    }

    cout << ans << "\n";
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2092 ms 55980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 53664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3012 KB Output is correct
2 Correct 18 ms 1084 KB Output is correct
3 Correct 19 ms 1028 KB Output is correct
4 Correct 112 ms 5832 KB Output is correct
5 Correct 64 ms 3268 KB Output is correct
6 Correct 23 ms 1100 KB Output is correct
7 Incorrect 26 ms 1228 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2092 ms 55980 KB Time limit exceeded
2 Halted 0 ms 0 KB -