oj.uz

Submission #958496

# Submission time Handle Problem Language Result Execution time Memory
958496 2024-04-05T22:27:22 Z BhavayGoyal Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 8448 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], dis[N], vis[N], dist[N][N];
set<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 = cc[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) {
    for (int i = 1; i <= n; i++) dis[i] = inf, vis[i] = 0;
    priority_queue<pii, vector<pii>, greater<>> q;
    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 = cc[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;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) dist[i][j] = inf;

    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], 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, i}));
            g[b].insert({a, i});
            ans = min(ans, get_dist(1, n) + get_dist(n, 1) + d);
            g[b].erase(g[b].find({a, i}));
            g[a].insert({b, i});
        }
        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 12 ms 928 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 12 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 9 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 10 ms 584 KB Output is correct
10 Correct 26 ms 964 KB Output is correct
11 Correct 29 ms 964 KB Output is correct
12 Correct 28 ms 860 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 9 ms 860 KB Output is correct
15 Correct 10 ms 928 KB Output is correct
16 Correct 8 ms 856 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 7484 KB Output is correct
2 Correct 72 ms 7504 KB Output is correct
3 Correct 86 ms 7680 KB Output is correct
4 Correct 9 ms 864 KB Output is correct
5 Correct 9 ms 916 KB Output is correct
6 Correct 7 ms 856 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 40 ms 7768 KB Output is correct
10 Correct 50 ms 7512 KB Output is correct
11 Correct 127 ms 7540 KB Output is correct
12 Correct 78 ms 7436 KB Output is correct
13 Correct 78 ms 7404 KB Output is correct
14 Correct 71 ms 7500 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 856 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 44 ms 6484 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 55 ms 8084 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 43 ms 7724 KB Output is correct
9 Correct 42 ms 7764 KB Output is correct
10 Correct 64 ms 7460 KB Output is correct
11 Correct 49 ms 7508 KB Output is correct
12 Correct 54 ms 7504 KB Output is correct
13 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 62 ms 7508 KB Output is correct
20 Correct 54 ms 7516 KB Output is correct
21 Correct 51 ms 7508 KB Output is correct
22 Correct 53 ms 7508 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 928 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 12 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 9 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 10 ms 584 KB Output is correct
10 Correct 26 ms 964 KB Output is correct
11 Correct 29 ms 964 KB Output is correct
12 Correct 28 ms 860 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 9 ms 860 KB Output is correct
15 Correct 10 ms 928 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 90 ms 7484 KB Output is correct
18 Correct 72 ms 7504 KB Output is correct
19 Correct 86 ms 7680 KB Output is correct
20 Correct 9 ms 864 KB Output is correct
21 Correct 9 ms 916 KB Output is correct
22 Correct 7 ms 856 KB Output is correct
23 Correct 7 ms 860 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 40 ms 7768 KB Output is correct
26 Correct 50 ms 7512 KB Output is correct
27 Correct 127 ms 7540 KB Output is correct
28 Correct 78 ms 7436 KB Output is correct
29 Correct 78 ms 7404 KB Output is correct
30 Correct 71 ms 7500 KB Output is correct
31 Correct 12 ms 856 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 44 ms 6484 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 55 ms 8084 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 43 ms 7724 KB Output is correct
39 Correct 42 ms 7764 KB Output is correct
40 Correct 64 ms 7460 KB Output is correct
41 Correct 49 ms 7508 KB Output is correct
42 Correct 54 ms 7504 KB Output is correct
43 Correct 0 ms 348 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 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 62 ms 7508 KB Output is correct
50 Correct 54 ms 7516 KB Output is correct
51 Correct 51 ms 7508 KB Output is correct
52 Correct 53 ms 7508 KB Output is correct
53 Correct 66 ms 8020 KB Output is correct
54 Correct 113 ms 8448 KB Output is correct
55 Correct 95 ms 8168 KB Output is correct
56 Correct 13 ms 860 KB Output is correct
57 Correct 8 ms 860 KB Output is correct
58 Correct 756 ms 7068 KB Output is correct
59 Correct 866 ms 7172 KB Output is correct
60 Execution timed out 1096 ms 7196 KB Time limit exceeded
61 Halted 0 ms 0 KB -