oj.uz

Submission #958492

# Submission time Handle Problem Language Result Execution time Memory
958492 2024-04-05T22:20:59 Z BhavayGoyal Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 7252 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 inf = 1e15;

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

const int N = 201, M = 50001;
int n, m, aa[M], bb[M], cc[M], dd[M], D[N];
multiset<pii> g[N];
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, inf), 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) {
    priority_queue<pii, vector<pii>, greater<>> q;
    vi vis(n+1, 0), dis(n+1, inf);
    q.push({0, s});
    dis[s] = 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) {
                dis[ch] = dis[src] + wt;
                q.push({dis[ch], ch});
            }
        }
    }

    return dis[t];
}


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

    for (int i = 1; i <= m; i++) {
        cin >> aa[i] >> bb[i] >> cc[i] >> dd[i];
        dist[aa[i]][bb[i]] = min(dist[aa[i]][bb[i]], cc[i]);
        g[aa[i]].insert({bb[i], cc[i]});
    }

    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(inf, dist[1][n] + dist[n][1]);

    for (int i = 1; i <= m; i++) {
        int a = aa[i], b = bb[i], c = cc[i], d = dd[i];
        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==inf?-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 7 ms 604 KB Output is correct
3 Correct 10 ms 860 KB Output is correct
4 Correct 11 ms 920 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 24 ms 860 KB Output is correct
11 Correct 29 ms 860 KB Output is correct
12 Correct 28 ms 960 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 10 ms 856 KB Output is correct
15 Correct 8 ms 856 KB Output is correct
16 Correct 9 ms 860 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 6404 KB Output is correct
2 Correct 71 ms 6544 KB Output is correct
3 Correct 75 ms 6632 KB Output is correct
4 Correct 9 ms 856 KB Output is correct
5 Correct 8 ms 860 KB Output is correct
6 Correct 8 ms 864 KB Output is correct
7 Correct 8 ms 856 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 34 ms 6356 KB Output is correct
10 Correct 34 ms 6492 KB Output is correct
11 Correct 104 ms 6272 KB Output is correct
12 Correct 69 ms 6424 KB Output is correct
13 Correct 71 ms 6224 KB Output is correct
14 Correct 70 ms 6384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 43 ms 5972 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 52 ms 7252 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 41 ms 6904 KB Output is correct
9 Correct 44 ms 6744 KB Output is correct
10 Correct 53 ms 6484 KB Output is correct
11 Correct 50 ms 6608 KB Output is correct
12 Correct 49 ms 6484 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 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 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 47 ms 6480 KB Output is correct
20 Correct 58 ms 6480 KB Output is correct
21 Correct 58 ms 6484 KB Output is correct
22 Correct 52 ms 6436 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 7 ms 604 KB Output is correct
3 Correct 10 ms 860 KB Output is correct
4 Correct 11 ms 920 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 24 ms 860 KB Output is correct
11 Correct 29 ms 860 KB Output is correct
12 Correct 28 ms 960 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 10 ms 856 KB Output is correct
15 Correct 8 ms 856 KB Output is correct
16 Correct 9 ms 860 KB Output is correct
17 Correct 83 ms 6404 KB Output is correct
18 Correct 71 ms 6544 KB Output is correct
19 Correct 75 ms 6632 KB Output is correct
20 Correct 9 ms 856 KB Output is correct
21 Correct 8 ms 860 KB Output is correct
22 Correct 8 ms 864 KB Output is correct
23 Correct 8 ms 856 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 34 ms 6356 KB Output is correct
26 Correct 34 ms 6492 KB Output is correct
27 Correct 104 ms 6272 KB Output is correct
28 Correct 69 ms 6424 KB Output is correct
29 Correct 71 ms 6224 KB Output is correct
30 Correct 70 ms 6384 KB Output is correct
31 Correct 8 ms 860 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 43 ms 5972 KB Output is correct
34 Correct 7 ms 604 KB Output is correct
35 Correct 52 ms 7252 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 41 ms 6904 KB Output is correct
39 Correct 44 ms 6744 KB Output is correct
40 Correct 53 ms 6484 KB Output is correct
41 Correct 50 ms 6608 KB Output is correct
42 Correct 49 ms 6484 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 348 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 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 47 ms 6480 KB Output is correct
50 Correct 58 ms 6480 KB Output is correct
51 Correct 58 ms 6484 KB Output is correct
52 Correct 52 ms 6436 KB Output is correct
53 Correct 64 ms 7252 KB Output is correct
54 Correct 100 ms 7216 KB Output is correct
55 Correct 101 ms 7164 KB Output is correct
56 Correct 9 ms 860 KB Output is correct
57 Correct 8 ms 1116 KB Output is correct
58 Correct 709 ms 6052 KB Output is correct
59 Correct 808 ms 6096 KB Output is correct
60 Execution timed out 1043 ms 6088 KB Time limit exceeded
61 Halted 0 ms 0 KB -