oj.uz

Submission #563679

# Submission time Handle Problem Language Result Execution time Memory
563679 2022-05-17T23:38:56 Z 4fecta Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 625 ms 7252 KB 
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

struct edge {
    int u, v, c, d, i;
};

const int MN = 205, MM = 50005;

int n, m, u, v, c, d, dist[MN][MN], fw[MM], bw[MM], dis[MN], vis[MN], dd[MN][MN];
vector<edge> a[MN];
edge es[MM];

int dijk(int st, int ed, int blk) {
    memset(dis, 0x3f, sizeof(dis));
    priority_queue<pii, vector<pii >, greater<>> q;
    dis[st] = 0;
    q.push({0, st});
    while (q.size()) {
        pii cur = q.top();
        q.pop();
        if (cur.f > dis[cur.s]) continue;
        for (edge nxt : a[cur.s]) {
            if (nxt.i == blk) continue;
            if (dis[nxt.v] > dis[cur.s] + nxt.c) {
                dis[nxt.v] = dis[cur.s] + nxt.c;
                q.push({dis[nxt.v], nxt.v});
            }
        }
    }
    return dis[ed];
}

int32_t main() {
    boost();

    memset(dist, 0x3f, sizeof(dist));
    memset(dd, 0x3f, sizeof(dd));
    cin >> n >> m;
    for (int i = 1; i <= n; i++) dist[i][i] = dd[i][i] = 0;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v >> c >> d;
        dist[u][v] = min(dist[u][v], c);
        dd[u][v] = 1;
        es[i] = {u, v, c, d, i};
        a[u].push_back({u, v, c, d, i});
    }
    for (int t = 0; t < 5; t++) {
        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]);
                    dd[i][j] = min(dd[i][j], dd[i][k] + dd[k][j]);
                }
            }
        }
    }
    int ans = dist[1][n] + dist[n][1];
    if (dist[1][n] < 1e12) {
        memset(vis, 0, sizeof(vis));
        int cur = 1;
        vis[cur] = 1;
        while (cur != n) {
            bool ok = 0;
            for (edge nxt : a[cur]) {
                if (dist[1][cur] + nxt.c + dist[nxt.v][n] == dist[1][n] && (nxt.c != 0 || dd[nxt.v][n] + 1 == dd[cur][n])) {
                    fw[nxt.i] = 1;
                    cur = nxt.v;
                    vis[cur] = 1;
                    ok = 1;
                    break;
                }
            }
            assert(ok);
        }
    }
    if (dist[n][1] < 1e12) {
        memset(vis, 0, sizeof(vis));
        int cur = n;
        vis[cur] = 1;
        while (cur != 1) {
            bool ok = 0;
            for (edge nxt : a[cur]) {
                if (dist[n][cur] + nxt.c + dist[nxt.v][1] == dist[n][1] && (nxt.c != 0 || dd[nxt.v][1] + 1 == dd[cur][1])) {
                    bw[nxt.i] = 1;
                    cur = nxt.v;
                    vis[cur] = 1;
                    ok = 1;
                    break;
                }
            }
            assert(ok);
        }
    }
    for (int i = 1; i <= m; i++) {
        int df = dist[1][n];
        if (fw[i]) df = dijk(1, n, i);
        else df = min(df, dist[1][es[i].v] + es[i].c + dist[es[i].u][n]);
        int db = dist[n][1];
        if (bw[i]) db = dijk(n, 1, i);
        else db = min(db, dist[n][es[i].v] + es[i].c + dist[es[i].u][1]);
        ans = min(ans, df + db + es[i].d);
    }
    printf("%lld\n", ans > 1e12 ? -1 : ans);

    return 0;
}
/*
4 4
1 2 0 4
1 3 0 3
4 3 0 2
4 1 0 1
 */

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1092 KB Output is correct
2 Correct 79 ms 996 KB Output is correct
3 Correct 77 ms 1076 KB Output is correct
4 Correct 77 ms 1108 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 73 ms 1004 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1136 KB Output is correct
10 Correct 87 ms 1108 KB Output is correct
11 Correct 89 ms 1112 KB Output is correct
12 Correct 88 ms 1108 KB Output is correct
13 Correct 81 ms 1108 KB Output is correct
14 Correct 78 ms 1104 KB Output is correct
15 Correct 73 ms 1108 KB Output is correct
16 Correct 73 ms 1104 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 5816 KB Output is correct
2 Correct 90 ms 5980 KB Output is correct
3 Correct 103 ms 6052 KB Output is correct
4 Correct 78 ms 1184 KB Output is correct
5 Correct 75 ms 1100 KB Output is correct
6 Correct 72 ms 1032 KB Output is correct
7 Correct 70 ms 1004 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 88 ms 5800 KB Output is correct
10 Correct 91 ms 5916 KB Output is correct
11 Correct 93 ms 5852 KB Output is correct
12 Correct 91 ms 5844 KB Output is correct
13 Correct 90 ms 6008 KB Output is correct
14 Correct 91 ms 6240 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1092 KB Output is correct
2 Correct 70 ms 996 KB Output is correct
3 Correct 88 ms 4744 KB Output is correct
4 Correct 75 ms 980 KB Output is correct
5 Correct 89 ms 5892 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 87 ms 5724 KB Output is correct
9 Correct 85 ms 5920 KB Output is correct
10 Correct 92 ms 5844 KB Output is correct
11 Correct 91 ms 5996 KB Output is correct
12 Correct 86 ms 5936 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 0 ms 980 KB Output is correct
19 Correct 86 ms 6112 KB Output is correct
20 Correct 91 ms 5972 KB Output is correct
21 Correct 91 ms 5928 KB Output is correct
22 Correct 88 ms 5776 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1092 KB Output is correct
2 Correct 79 ms 996 KB Output is correct
3 Correct 77 ms 1076 KB Output is correct
4 Correct 77 ms 1108 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 73 ms 1004 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1136 KB Output is correct
10 Correct 87 ms 1108 KB Output is correct
11 Correct 89 ms 1112 KB Output is correct
12 Correct 88 ms 1108 KB Output is correct
13 Correct 81 ms 1108 KB Output is correct
14 Correct 78 ms 1104 KB Output is correct
15 Correct 73 ms 1108 KB Output is correct
16 Correct 73 ms 1104 KB Output is correct
17 Correct 91 ms 5816 KB Output is correct
18 Correct 90 ms 5980 KB Output is correct
19 Correct 103 ms 6052 KB Output is correct
20 Correct 78 ms 1184 KB Output is correct
21 Correct 75 ms 1100 KB Output is correct
22 Correct 72 ms 1032 KB Output is correct
23 Correct 70 ms 1004 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 88 ms 5800 KB Output is correct
26 Correct 91 ms 5916 KB Output is correct
27 Correct 93 ms 5852 KB Output is correct
28 Correct 91 ms 5844 KB Output is correct
29 Correct 90 ms 6008 KB Output is correct
30 Correct 91 ms 6240 KB Output is correct
31 Correct 71 ms 1092 KB Output is correct
32 Correct 70 ms 996 KB Output is correct
33 Correct 88 ms 4744 KB Output is correct
34 Correct 75 ms 980 KB Output is correct
35 Correct 89 ms 5892 KB Output is correct
36 Correct 1 ms 980 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 87 ms 5724 KB Output is correct
39 Correct 85 ms 5920 KB Output is correct
40 Correct 92 ms 5844 KB Output is correct
41 Correct 91 ms 5996 KB Output is correct
42 Correct 86 ms 5936 KB Output is correct
43 Correct 1 ms 980 KB Output is correct
44 Correct 1 ms 980 KB Output is correct
45 Correct 1 ms 980 KB Output is correct
46 Correct 1 ms 980 KB Output is correct
47 Correct 1 ms 980 KB Output is correct
48 Correct 0 ms 980 KB Output is correct
49 Correct 86 ms 6112 KB Output is correct
50 Correct 91 ms 5972 KB Output is correct
51 Correct 91 ms 5928 KB Output is correct
52 Correct 88 ms 5776 KB Output is correct
53 Correct 90 ms 6792 KB Output is correct
54 Correct 88 ms 6820 KB Output is correct
55 Correct 98 ms 6720 KB Output is correct
56 Correct 71 ms 1108 KB Output is correct
57 Correct 69 ms 1124 KB Output is correct
58 Correct 136 ms 6176 KB Output is correct
59 Correct 141 ms 6180 KB Output is correct
60 Correct 146 ms 6248 KB Output is correct
61 Correct 134 ms 6176 KB Output is correct
62 Correct 139 ms 6160 KB Output is correct
63 Correct 144 ms 6216 KB Output is correct
64 Correct 625 ms 6760 KB Output is correct
65 Correct 585 ms 6784 KB Output is correct
66 Correct 555 ms 6668 KB Output is correct
67 Correct 14 ms 5704 KB Output is correct
68 Correct 89 ms 7052 KB Output is correct
69 Correct 89 ms 6860 KB Output is correct
70 Correct 94 ms 7196 KB Output is correct
71 Correct 95 ms 6996 KB Output is correct
72 Correct 98 ms 7224 KB Output is correct
73 Correct 90 ms 7252 KB Output is correct
74 Correct 100 ms 7176 KB Output is correct