oj.uz

Submission #963143

# Submission time Handle Problem Language Result Execution time Memory
963143 2024-04-14T15:06:51 Z toast12 Commuter Pass (JOI18_commuter_pass) C++14
24 / 100
 162 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

int main() {
    int n, m;
    cin >> n >> m;
    int s, t, u, v;
    cin >> s >> t >> u >> v;
    vector<vector<long long>> dist(n+1, vector<long long>(n+1, INF));
    for (int i = 0; i < m; i++) {
        int x, y;
        long long w;
        cin >> x >> y >> w;
        dist[x][x] = 0;
        dist[y][y] = 0;
        dist[x][y] = w;
        dist[y][x] = w;
    }
    // Floyd-Warshall's
    // finding the shortest path from i to j by find the path from i to k and k to j
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }
    long long ans = dist[u][v];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (dist[s][i]+dist[i][j]+dist[j][t] == dist[s][t]) {
                ans = min(ans, min({dist[u][i]+dist[v][i],
                                    dist[u][j]+dist[v][j],
                                    dist[u][i]+dist[v][j],
                                    dist[u][j]+dist[v][i]}));
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 101 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1384 KB Output is correct
2 Correct 22 ms 1116 KB Output is correct
3 Correct 23 ms 1112 KB Output is correct
4 Correct 48 ms 1880 KB Output is correct
5 Correct 37 ms 1372 KB Output is correct
6 Correct 29 ms 1028 KB Output is correct
7 Correct 24 ms 1196 KB Output is correct
8 Correct 28 ms 1212 KB Output is correct
9 Correct 27 ms 960 KB Output is correct
10 Correct 36 ms 1500 KB Output is correct
11 Correct 23 ms 1152 KB Output is correct
12 Correct 23 ms 1160 KB Output is correct
13 Correct 22 ms 1160 KB Output is correct
14 Correct 23 ms 1112 KB Output is correct
15 Correct 30 ms 1116 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -