oj.uz

Submission #958506

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

#define int unsigned int
#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 = 2e9;

// -------------------------------------------------- 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], isShort[M];
set<pii> g[N];

void dijkstra(int source) {
    priority_queue<pii, vector<pii>, greater<>> q;
    vi vis(n+1, 0), dis(n+1, inf), par(n+1), idx(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[src] < inf && dis[ch] > dis[src] + wt) {
                par[ch] = src;
                idx[ch] = child.s;
                dis[ch] = dis[src] + wt;
                q.push({dis[ch], ch});
            }
        }
    }

    int x = (source==1?n:1);
    while (par[x]) {
        isShort[idx[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[src] < inf && 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) {
                if (dist[i][k] < inf && dist[k][j] < inf)
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }

    int ans = inf;
    if (dist[1][n] < inf && dist[n][1] < inf) ans = 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[i]) {
            g[a].erase(g[a].find({b, i}));
            g[b].insert({a, i});
            int x = get_dist(1, n), y = get_dist(n, 1);
            if (x < inf && y < inf)
                ans = min(ans, x + y + d);
            g[b].erase(g[b].find({a, i}));
            g[a].insert({b, i});
        }
        else {
            int A = dist[1][n];
            int B = dist[n][1]; 
            if (dist[1][b] < inf && dist[a][n] < inf) A = min(A, dist[1][b] + c + dist[a][n]);
            if (dist[n][b] < inf && dist[a][1] < inf) B = min(B, dist[n][b] + c + dist[a][1]);
            if (A < inf && B < inf)
                ans = min(ans, A + B + d);
        }
    }

    if (ans == inf) cout << "-1" << endl;
    else cout << 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 600 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 12 ms 604 KB Output is correct
4 Correct 12 ms 716 KB Output is correct
5 Correct 1 ms 604 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 1 ms 348 KB Output is correct
10 Correct 28 ms 604 KB Output is correct
11 Correct 31 ms 604 KB Output is correct
12 Correct 30 ms 604 KB Output is correct
13 Correct 11 ms 604 KB Output is correct
14 Correct 14 ms 860 KB Output is correct
15 Correct 12 ms 744 KB Output is correct
16 Correct 11 ms 748 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4440 KB Output is correct
2 Correct 45 ms 4444 KB Output is correct
3 Correct 44 ms 4432 KB Output is correct
4 Correct 11 ms 600 KB Output is correct
5 Correct 10 ms 600 KB Output is correct
6 Correct 10 ms 604 KB Output is correct
7 Correct 9 ms 688 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 30 ms 4688 KB Output is correct
10 Correct 31 ms 4692 KB Output is correct
11 Correct 44 ms 4732 KB Output is correct
12 Correct 41 ms 4744 KB Output is correct
13 Correct 40 ms 4952 KB Output is correct
14 Correct 39 ms 5104 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 600 KB Output is correct
2 Correct 9 ms 604 KB Output is correct
3 Correct 38 ms 3816 KB Output is correct
4 Correct 9 ms 604 KB Output is correct
5 Correct 40 ms 4472 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 34 ms 4604 KB Output is correct
9 Correct 33 ms 4440 KB Output is correct
10 Correct 36 ms 4460 KB Output is correct
11 Correct 36 ms 4444 KB Output is correct
12 Correct 36 ms 4520 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 472 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 37 ms 4592 KB Output is correct
20 Correct 37 ms 4436 KB Output is correct
21 Correct 38 ms 4700 KB Output is correct
22 Correct 37 ms 4700 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 600 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 12 ms 604 KB Output is correct
4 Correct 12 ms 716 KB Output is correct
5 Correct 1 ms 604 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 1 ms 348 KB Output is correct
10 Correct 28 ms 604 KB Output is correct
11 Correct 31 ms 604 KB Output is correct
12 Correct 30 ms 604 KB Output is correct
13 Correct 11 ms 604 KB Output is correct
14 Correct 14 ms 860 KB Output is correct
15 Correct 12 ms 744 KB Output is correct
16 Correct 11 ms 748 KB Output is correct
17 Correct 44 ms 4440 KB Output is correct
18 Correct 45 ms 4444 KB Output is correct
19 Correct 44 ms 4432 KB Output is correct
20 Correct 11 ms 600 KB Output is correct
21 Correct 10 ms 600 KB Output is correct
22 Correct 10 ms 604 KB Output is correct
23 Correct 9 ms 688 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 30 ms 4688 KB Output is correct
26 Correct 31 ms 4692 KB Output is correct
27 Correct 44 ms 4732 KB Output is correct
28 Correct 41 ms 4744 KB Output is correct
29 Correct 40 ms 4952 KB Output is correct
30 Correct 39 ms 5104 KB Output is correct
31 Correct 11 ms 600 KB Output is correct
32 Correct 9 ms 604 KB Output is correct
33 Correct 38 ms 3816 KB Output is correct
34 Correct 9 ms 604 KB Output is correct
35 Correct 40 ms 4472 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 34 ms 4604 KB Output is correct
39 Correct 33 ms 4440 KB Output is correct
40 Correct 36 ms 4460 KB Output is correct
41 Correct 36 ms 4444 KB Output is correct
42 Correct 36 ms 4520 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 472 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 37 ms 4592 KB Output is correct
50 Correct 37 ms 4436 KB Output is correct
51 Correct 38 ms 4700 KB Output is correct
52 Correct 37 ms 4700 KB Output is correct
53 Correct 48 ms 4700 KB Output is correct
54 Correct 61 ms 4752 KB Output is correct
55 Correct 57 ms 4692 KB Output is correct
56 Correct 13 ms 604 KB Output is correct
57 Correct 13 ms 748 KB Output is correct
58 Correct 382 ms 4128 KB Output is correct
59 Correct 432 ms 4120 KB Output is correct
60 Correct 590 ms 4116 KB Output is correct
61 Correct 369 ms 3932 KB Output is correct
62 Correct 423 ms 4120 KB Output is correct
63 Correct 575 ms 4116 KB Output is correct
64 Correct 838 ms 4580 KB Output is correct
65 Correct 925 ms 4624 KB Output is correct
66 Execution timed out 1026 ms 4548 KB Time limit exceeded
67 Halted 0 ms 0 KB -