Submission #519435

# Submission time Handle Problem Language Result Execution time Memory
519435 2022-01-26T10:59:12 Z Jarif_Rahman Commuter Pass (JOI18_commuter_pass) C++17
0 / 100
2000 ms 59932 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 = 1e16;

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<vector<ll>> d(n);
    for(int i = 0; i < n; i++) d[i] = dijsktra(v, i);

    ll ans = d[U][V];

    for(int i = 0; i < n; i++) for(int j = i; j < n; j++){
        if(d[S][i]+d[i][j]+d[T][j] == d[S][T]) ans = min(ans, min(d[U][i]+d[V][j], d[U][j]+d[V][i]));
    }

    cout << ans << "\n";
}
# Verdict Execution time Memory Grader output
1 Execution timed out 2101 ms 59932 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2011 ms 55572 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 58 ms 3388 KB Output is correct
2 Correct 18 ms 1084 KB Output is correct
3 Correct 23 ms 1076 KB Output is correct
4 Correct 96 ms 5700 KB Output is correct
5 Correct 60 ms 3268 KB Output is correct
6 Correct 23 ms 1080 KB Output is correct
7 Incorrect 29 ms 1220 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2101 ms 59932 KB Time limit exceeded
2 Halted 0 ms 0 KB -