oj.uz

Submission #958490

# Submission time Handle Problem Language Result Execution time Memory
958490 2024-04-05T22:15:56 Z BhavayGoyal Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 9220 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define endl "\n"

const int linf = 1e15;

// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 201, M = 50001;
int n, m;
multiset<pii> g[N];
vii edges;
map<pair<int, int>, bool> isShort;

void dijkstra(int source) {
    priority_queue<pii, vector<pii>, greater<>> q;
    vi vis(n+1, 0), dis(n+1, linf), par(n+1);
    q.push({0, source});
    dis[source] = 0;
    while (!q.empty()) {
        pii f = q.top(); q.pop();
        int src = f.s;
        if (vis[src]) continue;
        vis[src] = true;

        for (auto child : g[src]) {
            int ch = child.f, wt = child.s;
            if (dis[ch] > dis[src] + wt) {
                par[ch] = src;
                dis[ch] = dis[src] + wt;
                q.push({dis[ch], ch});
            }
        }
    }

    int x = (source==1?n:1);
    while (par[x]) {
        isShort[{par[x], x}] = true;
        x = par[x];
    }
}

int get_dist(int s, int t) {
    vi D(n+1, linf);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    D[s] = 0;
    pq.emplace(0, s);
    while (pq.size()) {
        pii temp = pq.top(); int x = temp.f, u = temp.s;
        pq.pop();
        if (D[u] == x) {
            for (pii child : g[u]) {
                int v = child.f, wt = child.s;
                if (D[v] > x + wt) {
                    pq.emplace(D[v] = x + wt, v);
                }
            }
        }
    }
    return D[t];
}


void sol() {
    cin >> n >> m;
    vii dist(n+1, vi(n+1, linf));
    for (int i = 1; i <= n; i++) dist[i][i] = 0;

    for (int i = 1; i <= m; i++) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        dist[a][b] = min(dist[a][b], c);
        g[a].insert({b, c});
        edges.pb({a, b, c, d});
    }

    dijkstra(1);
    dijkstra(n);
    
    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]);
            }
        }
    }

    int ans = min(linf, dist[1][n] + dist[n][1]);

    for (auto i : edges) {
        int a = i[0], b = i[1], c = i[2], d = i[3];
        if (isShort[{a, b}]) {
            g[a].erase(g[a].find({b, c}));
            g[b].insert({a, c});
            ans = min(ans, get_dist(1, n) + get_dist(n, 1) + d);
            g[b].erase(g[b].find({a, c}));
            g[a].insert({b, c});
        }
        else {
            int A = min(dist[1][n], dist[1][b] + c + dist[a][n]);
            int B = min(dist[n][1], dist[n][b] + c + dist[a][1]);
            ans = min(ans, A + B + d);
        }
    }

    cout << (ans==linf?-1:ans) << endl;
}

signed main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 8 ms 828 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 604 KB Output is correct
10 Correct 23 ms 860 KB Output is correct
11 Correct 28 ms 964 KB Output is correct
12 Correct 27 ms 860 KB Output is correct
13 Correct 9 ms 936 KB Output is correct
14 Correct 8 ms 856 KB Output is correct
15 Correct 8 ms 936 KB Output is correct
16 Correct 8 ms 860 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8704 KB Output is correct
2 Correct 79 ms 8596 KB Output is correct
3 Correct 80 ms 8452 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 8 ms 860 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 46 ms 8452 KB Output is correct
10 Correct 41 ms 8456 KB Output is correct
11 Correct 99 ms 8200 KB Output is correct
12 Correct 73 ms 8240 KB Output is correct
13 Correct 76 ms 8256 KB Output is correct
14 Correct 77 ms 8196 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 856 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 47 ms 7428 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 67 ms 9196 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 42 ms 8824 KB Output is correct
9 Correct 41 ms 8712 KB Output is correct
10 Correct 56 ms 8452 KB Output is correct
11 Correct 49 ms 8416 KB Output is correct
12 Correct 53 ms 8448 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 52 ms 8356 KB Output is correct
20 Correct 52 ms 8452 KB Output is correct
21 Correct 54 ms 8456 KB Output is correct
22 Correct 57 ms 8568 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 8 ms 828 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 604 KB Output is correct
10 Correct 23 ms 860 KB Output is correct
11 Correct 28 ms 964 KB Output is correct
12 Correct 27 ms 860 KB Output is correct
13 Correct 9 ms 936 KB Output is correct
14 Correct 8 ms 856 KB Output is correct
15 Correct 8 ms 936 KB Output is correct
16 Correct 8 ms 860 KB Output is correct
17 Correct 99 ms 8704 KB Output is correct
18 Correct 79 ms 8596 KB Output is correct
19 Correct 80 ms 8452 KB Output is correct
20 Correct 9 ms 1116 KB Output is correct
21 Correct 8 ms 860 KB Output is correct
22 Correct 7 ms 860 KB Output is correct
23 Correct 7 ms 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 46 ms 8452 KB Output is correct
26 Correct 41 ms 8456 KB Output is correct
27 Correct 99 ms 8200 KB Output is correct
28 Correct 73 ms 8240 KB Output is correct
29 Correct 76 ms 8256 KB Output is correct
30 Correct 77 ms 8196 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 47 ms 7428 KB Output is correct
34 Correct 7 ms 604 KB Output is correct
35 Correct 67 ms 9196 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 42 ms 8824 KB Output is correct
39 Correct 41 ms 8712 KB Output is correct
40 Correct 56 ms 8452 KB Output is correct
41 Correct 49 ms 8416 KB Output is correct
42 Correct 53 ms 8448 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 52 ms 8356 KB Output is correct
50 Correct 52 ms 8452 KB Output is correct
51 Correct 54 ms 8456 KB Output is correct
52 Correct 57 ms 8568 KB Output is correct
53 Correct 84 ms 9016 KB Output is correct
54 Correct 106 ms 9220 KB Output is correct
55 Correct 99 ms 8976 KB Output is correct
56 Correct 9 ms 860 KB Output is correct
57 Correct 8 ms 980 KB Output is correct
58 Correct 733 ms 7684 KB Output is correct
59 Correct 834 ms 7504 KB Output is correct
60 Execution timed out 1028 ms 7500 KB Time limit exceeded
61 Halted 0 ms 0 KB -