oj.uz

Submission #958510

# Submission time Handle Problem Language Result Execution time Memory
958510 2024-04-05T22:42:06 Z BhavayGoyal Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 5880 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], 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[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[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[i]) {
            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 9 ms 2396 KB Output is correct
2 Correct 8 ms 2392 KB Output is correct
3 Correct 9 ms 2396 KB Output is correct
4 Correct 9 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 9 ms 2552 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 24 ms 2392 KB Output is correct
11 Correct 30 ms 2396 KB Output is correct
12 Correct 28 ms 2592 KB Output is correct
13 Correct 10 ms 2392 KB Output is correct
14 Correct 9 ms 2396 KB Output is correct
15 Correct 8 ms 2396 KB Output is correct
16 Correct 8 ms 2396 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5740 KB Output is correct
2 Correct 43 ms 5724 KB Output is correct
3 Correct 41 ms 5724 KB Output is correct
4 Correct 10 ms 2680 KB Output is correct
5 Correct 9 ms 2396 KB Output is correct
6 Correct 10 ms 2392 KB Output is correct
7 Correct 8 ms 2556 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 28 ms 5716 KB Output is correct
10 Correct 28 ms 5712 KB Output is correct
11 Correct 43 ms 5724 KB Output is correct
12 Correct 48 ms 5880 KB Output is correct
13 Correct 38 ms 5736 KB Output is correct
14 Correct 44 ms 5716 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2396 KB Output is correct
2 Correct 8 ms 2552 KB Output is correct
3 Correct 34 ms 4956 KB Output is correct
4 Correct 8 ms 2392 KB Output is correct
5 Correct 36 ms 5676 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 28 ms 5724 KB Output is correct
9 Correct 29 ms 5724 KB Output is correct
10 Correct 35 ms 5724 KB Output is correct
11 Correct 33 ms 5724 KB Output is correct
12 Correct 33 ms 5720 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 47 ms 5724 KB Output is correct
20 Correct 34 ms 5724 KB Output is correct
21 Correct 35 ms 5728 KB Output is correct
22 Correct 34 ms 5724 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2396 KB Output is correct
2 Correct 8 ms 2392 KB Output is correct
3 Correct 9 ms 2396 KB Output is correct
4 Correct 9 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 9 ms 2552 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 24 ms 2392 KB Output is correct
11 Correct 30 ms 2396 KB Output is correct
12 Correct 28 ms 2592 KB Output is correct
13 Correct 10 ms 2392 KB Output is correct
14 Correct 9 ms 2396 KB Output is correct
15 Correct 8 ms 2396 KB Output is correct
16 Correct 8 ms 2396 KB Output is correct
17 Correct 40 ms 5740 KB Output is correct
18 Correct 43 ms 5724 KB Output is correct
19 Correct 41 ms 5724 KB Output is correct
20 Correct 10 ms 2680 KB Output is correct
21 Correct 9 ms 2396 KB Output is correct
22 Correct 10 ms 2392 KB Output is correct
23 Correct 8 ms 2556 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 28 ms 5716 KB Output is correct
26 Correct 28 ms 5712 KB Output is correct
27 Correct 43 ms 5724 KB Output is correct
28 Correct 48 ms 5880 KB Output is correct
29 Correct 38 ms 5736 KB Output is correct
30 Correct 44 ms 5716 KB Output is correct
31 Correct 9 ms 2396 KB Output is correct
32 Correct 8 ms 2552 KB Output is correct
33 Correct 34 ms 4956 KB Output is correct
34 Correct 8 ms 2392 KB Output is correct
35 Correct 36 ms 5676 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 28 ms 5724 KB Output is correct
39 Correct 29 ms 5724 KB Output is correct
40 Correct 35 ms 5724 KB Output is correct
41 Correct 33 ms 5724 KB Output is correct
42 Correct 33 ms 5720 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 0 ms 2396 KB Output is correct
49 Correct 47 ms 5724 KB Output is correct
50 Correct 34 ms 5724 KB Output is correct
51 Correct 35 ms 5728 KB Output is correct
52 Correct 34 ms 5724 KB Output is correct
53 Correct 46 ms 5724 KB Output is correct
54 Correct 58 ms 5720 KB Output is correct
55 Correct 54 ms 5724 KB Output is correct
56 Correct 9 ms 2396 KB Output is correct
57 Correct 8 ms 2608 KB Output is correct
58 Correct 374 ms 5196 KB Output is correct
59 Correct 434 ms 5212 KB Output is correct
60 Correct 591 ms 5224 KB Output is correct
61 Correct 375 ms 5208 KB Output is correct
62 Correct 435 ms 5208 KB Output is correct
63 Correct 597 ms 5208 KB Output is correct
64 Correct 866 ms 5604 KB Output is correct
65 Correct 924 ms 5696 KB Output is correct
66 Execution timed out 1035 ms 5616 KB Time limit exceeded
67 Halted 0 ms 0 KB -