oj.uz

Submission #740639

# Submission time Handle Problem Language Result Execution time Memory
740639 2023-05-12T23:12:26 Z stevancv Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 3584 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 200 + 2;
const int M = 5e4 + 2;
const ll linf = 1e18;
ll dist[N][N], di[N];
vector<pair<int, int>> g[N];
int u[M], v[M], c[M], d[M], is[M], prv[N], n, m;
void Dijkstra(int x) {
    for (int i = 0; i < n; i++) di[i] = linf;
    vector<int> was(n);
    priority_queue<pair<ll, int>> pq;
    di[x] = 0;
    pq.push({0, x});
    while (!pq.empty()) {
        ll v = -pq.top().first;
        int s = pq.top().second;
        pq.pop();
        if (was[s] == 1) continue;
        was[s] = 1;
        for (auto zz : g[s]) {
            int u = zz.first; int i = zz.second;
            if (di[u] > v + c[i]) {
                di[u] = v + c[i];
                pq.push({-di[u], u});
                prv[u] = i;
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) dist[i][j] = linf;
    for (int i = 0; i < m; i++) {
        cin >> u[i] >> v[i] >> c[i] >> d[i];
        u[i] -= 1; v[i] -= 1;
        smin(dist[u[i]][v[i]],(ll) c[i]);
        g[u[i]].push_back({v[i], i});
    }
    for (int k = 0; k < n; k++) for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) smin(dist[i][j], dist[i][k] + dist[k][j]);
    for (int i = 0; i < n; i++) prv[i] = -1;
    Dijkstra(0);
    for (int i = 0; i < n; i++) if (prv[i] != -1) is[prv[i]] = 1;
    for (int i = 0; i < n; i++) prv[i] = -1;
    Dijkstra(n - 1);
    for (int i = 0; i < n; i++) if (prv[i] != -1) is[prv[i]] = 1;
    ll ans = linf;
    if (dist[0][n - 1] != linf && dist[n - 1][0] != linf) ans = dist[0][n - 1] + dist[n - 1][0];
    for (int i = 0; i < m; i++) {
        if (is[i] == 0) {
            ll d1 = min(dist[0][n - 1], dist[0][v[i]] + c[i] + dist[u[i]][n - 1]);
            ll d2 = min(dist[n - 1][0], dist[n - 1][v[i]] + c[i] + dist[u[i]][0]);
            if (d1 < linf && d2 < linf) smin(ans, d1 + d2 + d[i]);
            continue;
        }
        for (int j = 0; j < n; j++) g[j].clear();
        for (int j = 0; j < m; j++) {
            if (i == j) g[v[j]].push_back({u[j], j});
            else g[u[j]].push_back({v[j], j});
        }
        ll ret = d[i];
        Dijkstra(0);
        if (di[n - 1] == linf) continue;
        ret += di[n - 1];
        Dijkstra(n - 1);
        if (di[0] == linf) continue;
        ret += di[0];
        smin(ans, ret);
    }
    if (ans == linf) ans = -1;
    cout << ans << en;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 596 KB Output is correct
2 Correct 9 ms 596 KB Output is correct
3 Correct 24 ms 712 KB Output is correct
4 Correct 27 ms 708 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 12 ms 660 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 26 ms 724 KB Output is correct
11 Correct 34 ms 724 KB Output is correct
12 Correct 34 ms 744 KB Output is correct
13 Correct 13 ms 712 KB Output is correct
14 Correct 20 ms 736 KB Output is correct
15 Correct 15 ms 736 KB Output is correct
16 Correct 18 ms 692 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 2324 KB Output is correct
2 Correct 281 ms 3312 KB Output is correct
3 Correct 253 ms 3516 KB Output is correct
4 Correct 26 ms 724 KB Output is correct
5 Correct 18 ms 724 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 9 ms 596 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 102 ms 3352 KB Output is correct
10 Correct 107 ms 3412 KB Output is correct
11 Correct 175 ms 3456 KB Output is correct
12 Correct 201 ms 3536 KB Output is correct
13 Correct 150 ms 3552 KB Output is correct
14 Correct 129 ms 3584 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 716 KB Output is correct
2 Correct 10 ms 680 KB Output is correct
3 Correct 204 ms 2636 KB Output is correct
4 Correct 9 ms 596 KB Output is correct
5 Correct 227 ms 3216 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 116 ms 3192 KB Output is correct
9 Correct 130 ms 3148 KB Output is correct
10 Correct 183 ms 3220 KB Output is correct
11 Correct 167 ms 3168 KB Output is correct
12 Correct 182 ms 3244 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 201 ms 3156 KB Output is correct
20 Correct 164 ms 3156 KB Output is correct
21 Correct 163 ms 3344 KB Output is correct
22 Correct 163 ms 3204 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 596 KB Output is correct
2 Correct 9 ms 596 KB Output is correct
3 Correct 24 ms 712 KB Output is correct
4 Correct 27 ms 708 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 12 ms 660 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 26 ms 724 KB Output is correct
11 Correct 34 ms 724 KB Output is correct
12 Correct 34 ms 744 KB Output is correct
13 Correct 13 ms 712 KB Output is correct
14 Correct 20 ms 736 KB Output is correct
15 Correct 15 ms 736 KB Output is correct
16 Correct 18 ms 692 KB Output is correct
17 Correct 245 ms 2324 KB Output is correct
18 Correct 281 ms 3312 KB Output is correct
19 Correct 253 ms 3516 KB Output is correct
20 Correct 26 ms 724 KB Output is correct
21 Correct 18 ms 724 KB Output is correct
22 Correct 9 ms 596 KB Output is correct
23 Correct 9 ms 596 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 102 ms 3352 KB Output is correct
26 Correct 107 ms 3412 KB Output is correct
27 Correct 175 ms 3456 KB Output is correct
28 Correct 201 ms 3536 KB Output is correct
29 Correct 150 ms 3552 KB Output is correct
30 Correct 129 ms 3584 KB Output is correct
31 Correct 18 ms 716 KB Output is correct
32 Correct 10 ms 680 KB Output is correct
33 Correct 204 ms 2636 KB Output is correct
34 Correct 9 ms 596 KB Output is correct
35 Correct 227 ms 3216 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 116 ms 3192 KB Output is correct
39 Correct 130 ms 3148 KB Output is correct
40 Correct 183 ms 3220 KB Output is correct
41 Correct 167 ms 3168 KB Output is correct
42 Correct 182 ms 3244 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 201 ms 3156 KB Output is correct
50 Correct 164 ms 3156 KB Output is correct
51 Correct 163 ms 3344 KB Output is correct
52 Correct 163 ms 3204 KB Output is correct
53 Correct 230 ms 3228 KB Output is correct
54 Correct 286 ms 3404 KB Output is correct
55 Correct 234 ms 3292 KB Output is correct
56 Correct 27 ms 708 KB Output is correct
57 Correct 25 ms 728 KB Output is correct
58 Correct 157 ms 2776 KB Output is correct
59 Correct 183 ms 2768 KB Output is correct
60 Correct 263 ms 2728 KB Output is correct
61 Correct 147 ms 2784 KB Output is correct
62 Correct 177 ms 2776 KB Output is correct
63 Correct 242 ms 2756 KB Output is correct
64 Correct 707 ms 3204 KB Output is correct
65 Correct 750 ms 3336 KB Output is correct
66 Execution timed out 1006 ms 3252 KB Time limit exceeded
67 Halted 0 ms 0 KB -