oj.uz

Submission #898239

# Submission time Handle Problem Language Result Execution time Memory
898239 2024-01-04T11:56:13 Z oviyan_gandhi Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 3992 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
typedef pair<int, int> pii;

#define MAXN 200
#define MAXM 50000
struct Edge {
    int u, v, c, d;
};

int n, m;
Edge edges[MAXM];
list<int> adj[MAXN];
int dist[MAXN][MAXN];
int dis[MAXN];

int cost(int s, int t, int ri){
    fill(dis, dis+n, INF);
    priority_queue<pii> pq;
    pq.push({0, s});
    dis[s] = 0;
    while (!pq.empty()){
        auto [d, u] = pq.top();
        pq.pop();
        if (dis[u] != d) continue;
        if (ri != -1 && edges[ri].v == u){
            int v = edges[ri].u, cd = edges[ri].c;
            if (d + cd < dis[v]){
                dis[v] = d + cd;
                pq.push({dis[v], v});
            }
        }
        for (int i : adj[u]){
            if (i == ri) continue;
            int v = edges[i].v, cd = edges[i].c;
            if (d + cd < dis[v]){
                dis[v] = d + cd;
                pq.push({dis[v], v});
            }
        }
    }
    return dis[t];
}

int cost(int ri = -1){ return cost(0, n-1, ri) + cost(n-1, 0, ri); }

int32_t main(){
    // freopen("sol.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++)
            dist[i][j] = INF;
        dist[i][i] = 0;
    }
    for (int i = 0; i < m; i++){
        auto &[u, v, c, d] = edges[i];
        cin >> u >> v >> c >> d;
        u--, v--;
        adj[u].push_back(i);
        dist[u][v] = min(dist[u][v], c);
    }
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
    int ans = cost();
    for (int i = 0; i < m; i++){
        auto [u, v, c, d] = edges[i];
        int fw = min(dist[0][n-1], dist[0][v] + c + dist[u][n-1]),
            bw = min(dist[n-1][0], dist[n-1][v] + c + dist[u][0]);
        if (fw < INF && bw < INF && (fw + bw + d) < ans)
            ans = min(ans, cost(i) + d);
    }
    cout << (ans >= INF ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 8 ms 648 KB Output is correct
3 Correct 9 ms 480 KB Output is correct
4 Correct 9 ms 696 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 99 ms 604 KB Output is correct
11 Correct 433 ms 680 KB Output is correct
12 Correct 25 ms 604 KB Output is correct
13 Correct 11 ms 692 KB Output is correct
14 Correct 9 ms 856 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 12 ms 692 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 3588 KB Output is correct
2 Correct 271 ms 3716 KB Output is correct
3 Correct 110 ms 3736 KB Output is correct
4 Correct 13 ms 600 KB Output is correct
5 Correct 11 ms 692 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 911 ms 3716 KB Output is correct
10 Correct 554 ms 3924 KB Output is correct
11 Correct 137 ms 3664 KB Output is correct
12 Correct 223 ms 3920 KB Output is correct
13 Correct 111 ms 3576 KB Output is correct
14 Correct 222 ms 3672 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 18 ms 2908 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 22 ms 3672 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 37 ms 3744 KB Output is correct
9 Correct 42 ms 3720 KB Output is correct
10 Correct 22 ms 3732 KB Output is correct
11 Correct 23 ms 3676 KB Output is correct
12 Correct 27 ms 3676 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 476 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 23 ms 3548 KB Output is correct
20 Correct 24 ms 3992 KB Output is correct
21 Correct 23 ms 3676 KB Output is correct
22 Correct 22 ms 3748 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 8 ms 648 KB Output is correct
3 Correct 9 ms 480 KB Output is correct
4 Correct 9 ms 696 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 99 ms 604 KB Output is correct
11 Correct 433 ms 680 KB Output is correct
12 Correct 25 ms 604 KB Output is correct
13 Correct 11 ms 692 KB Output is correct
14 Correct 9 ms 856 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 12 ms 692 KB Output is correct
17 Correct 109 ms 3588 KB Output is correct
18 Correct 271 ms 3716 KB Output is correct
19 Correct 110 ms 3736 KB Output is correct
20 Correct 13 ms 600 KB Output is correct
21 Correct 11 ms 692 KB Output is correct
22 Correct 8 ms 604 KB Output is correct
23 Correct 7 ms 604 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 911 ms 3716 KB Output is correct
26 Correct 554 ms 3924 KB Output is correct
27 Correct 137 ms 3664 KB Output is correct
28 Correct 223 ms 3920 KB Output is correct
29 Correct 111 ms 3576 KB Output is correct
30 Correct 222 ms 3672 KB Output is correct
31 Correct 8 ms 600 KB Output is correct
32 Correct 10 ms 604 KB Output is correct
33 Correct 18 ms 2908 KB Output is correct
34 Correct 7 ms 604 KB Output is correct
35 Correct 22 ms 3672 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 476 KB Output is correct
38 Correct 37 ms 3744 KB Output is correct
39 Correct 42 ms 3720 KB Output is correct
40 Correct 22 ms 3732 KB Output is correct
41 Correct 23 ms 3676 KB Output is correct
42 Correct 27 ms 3676 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 476 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 23 ms 3548 KB Output is correct
50 Correct 24 ms 3992 KB Output is correct
51 Correct 23 ms 3676 KB Output is correct
52 Correct 22 ms 3748 KB Output is correct
53 Correct 147 ms 3800 KB Output is correct
54 Correct 138 ms 3672 KB Output is correct
55 Correct 140 ms 3672 KB Output is correct
56 Correct 9 ms 604 KB Output is correct
57 Correct 9 ms 676 KB Output is correct
58 Correct 129 ms 3420 KB Output is correct
59 Correct 198 ms 3416 KB Output is correct
60 Correct 301 ms 3256 KB Output is correct
61 Correct 156 ms 3164 KB Output is correct
62 Execution timed out 1038 ms 3220 KB Time limit exceeded
63 Halted 0 ms 0 KB -