oj.uz

Submission #286638

# Submission time Handle Problem Language Result Execution time Memory
286638 2020-08-30T15:51:39 Z valerikk Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 2808 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long

const int N = 205, M = 5e4 + 7;
const long long INF = 1e18 + 39;
struct Edge{
    int v, u;
    long long c, d;
    Edge() {}
    Edge(int v, int u, long long c, long long d) : v(v), u(u), c(c), d(d) {}
};

int n ,m;
Edge edg[M];

void dijks(int st, long long d[], int p[], bool rev, vector<int> g[], int ign) {
    for (int i = 0; i < n; ++i) {
        d[i] = INF;
        p[i] = -1;
    }
    d[st] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push({d[st], st});
    while (!q.empty()) {
        auto cur = q.top();
        q.pop();
        int v = cur.second;
        if (d[v] != cur.first)
            continue;
        for (auto id : g[v]) {
            if (id == ign) continue;
            int w = edg[id].c, u = rev ? edg[id].v : edg[id].u;
            if (d[v] + w < d[u]) {
                d[u] = d[v] + w;
                p[u] = id;
                q.push({d[u], u});
            }
        }
    }
}

vector<int> g[N], gr[N];
long long d1[N], dn[N];
long long d1r[N], dnr[N];
int p1[N], pn[N];
int p1r[N], pnr[N];
bool bad1[M], badn[M];
bool bad1r[M], badnr[M];
long long tmp_d[N];
int tmp_p[N];

long long get_d1(int v, int ign) {
    if (bad1[ign]) {
        dijks(0, tmp_d, tmp_p, 0, g, ign);
        return tmp_d[v];
    }
    return d1[v];
}

long long get_dn(int v, int ign) {
    if (badn[ign]) {
        dijks(n - 1, tmp_d, tmp_p, 0, g, ign);
        return tmp_d[v];
    }
    return dn[v];
}

long long get_d1r(int v, int ign) {
    if (bad1r[ign]) {
        dijks(0, tmp_d, tmp_p, 1, gr, ign);
        return tmp_d[v];
    }
    return d1r[v];
}

long long get_dnr(int v, int ign) {
    if (badnr[ign]) {
        dijks(n - 1, tmp_d, tmp_p, 1, gr, ign);
        return tmp_d[v];
    }
    return dnr[v];
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        cin >> edg[i].v >> edg[i].u >> edg[i].c >> edg[i].d;
        edg[i].v--;
        edg[i].u--;
        g[edg[i].v].push_back(i);
        gr[edg[i].u].push_back(i);
    }
    dijks(0, d1, p1, 0, g, -1);
    dijks(0, d1r, p1r, 1, gr, -1);
    dijks(n - 1, dn, pn, 0, g, -1);
    dijks(n - 1, dnr, pnr, 1, gr, -1);
    for (int i = 0; i < n; ++i) {
        if (~p1[i])
            bad1[p1[i]] = 1;
        if (~pn[i])
            badn[pn[i]] = 1;
        if (~p1r[i])
            bad1r[p1r[i]] = 1;
        if (~pnr[i])
            badnr[pnr[i]] = 1;
    }
    long long ans = min(INF, d1[n - 1] + dn[0]);
    for (int i = 0; i < m; ++i) {
        long long dist1 = min(get_d1(n - 1, i), get_d1(edg[i].u, i) + get_dnr(edg[i].v, i) + edg[i].c);
        long long distn = min(get_dn(0, i), get_dn(edg[i].u, i) + get_d1r(edg[i].v, i) + edg[i].c);
        ans = min(ans, dist1 + distn + edg[i].d);
    }
    if (ans == INF)
        cout << "-1\n";
    else
        cout << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 38 ms 384 KB Output is correct
4 Correct 48 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 54 ms 384 KB Output is correct
11 Correct 63 ms 384 KB Output is correct
12 Correct 54 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 22 ms 384 KB Output is correct
15 Correct 21 ms 384 KB Output is correct
16 Correct 23 ms 504 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 2552 KB Output is correct
2 Correct 384 ms 2688 KB Output is correct
3 Correct 391 ms 2808 KB Output is correct
4 Correct 37 ms 512 KB Output is correct
5 Correct 18 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 88 ms 2560 KB Output is correct
10 Correct 85 ms 2560 KB Output is correct
11 Correct 242 ms 2680 KB Output is correct
12 Correct 243 ms 2688 KB Output is correct
13 Correct 241 ms 2560 KB Output is correct
14 Correct 238 ms 2684 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 234 ms 2176 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 299 ms 2668 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 69 ms 2556 KB Output is correct
9 Correct 76 ms 2560 KB Output is correct
10 Correct 196 ms 2552 KB Output is correct
11 Correct 194 ms 2552 KB Output is correct
12 Correct 200 ms 2688 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 196 ms 2680 KB Output is correct
20 Correct 190 ms 2560 KB Output is correct
21 Correct 194 ms 2560 KB Output is correct
22 Correct 195 ms 2688 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 38 ms 384 KB Output is correct
4 Correct 48 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 54 ms 384 KB Output is correct
11 Correct 63 ms 384 KB Output is correct
12 Correct 54 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 22 ms 384 KB Output is correct
15 Correct 21 ms 384 KB Output is correct
16 Correct 23 ms 504 KB Output is correct
17 Correct 392 ms 2552 KB Output is correct
18 Correct 384 ms 2688 KB Output is correct
19 Correct 391 ms 2808 KB Output is correct
20 Correct 37 ms 512 KB Output is correct
21 Correct 18 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 88 ms 2560 KB Output is correct
26 Correct 85 ms 2560 KB Output is correct
27 Correct 242 ms 2680 KB Output is correct
28 Correct 243 ms 2688 KB Output is correct
29 Correct 241 ms 2560 KB Output is correct
30 Correct 238 ms 2684 KB Output is correct
31 Correct 28 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 234 ms 2176 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 299 ms 2668 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 69 ms 2556 KB Output is correct
39 Correct 76 ms 2560 KB Output is correct
40 Correct 196 ms 2552 KB Output is correct
41 Correct 194 ms 2552 KB Output is correct
42 Correct 200 ms 2688 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 196 ms 2680 KB Output is correct
50 Correct 190 ms 2560 KB Output is correct
51 Correct 194 ms 2560 KB Output is correct
52 Correct 195 ms 2688 KB Output is correct
53 Correct 421 ms 2664 KB Output is correct
54 Correct 425 ms 2680 KB Output is correct
55 Correct 426 ms 2552 KB Output is correct
56 Correct 40 ms 504 KB Output is correct
57 Correct 43 ms 384 KB Output is correct
58 Correct 357 ms 2176 KB Output is correct
59 Correct 379 ms 2176 KB Output is correct
60 Correct 384 ms 2176 KB Output is correct
61 Correct 350 ms 2176 KB Output is correct
62 Correct 367 ms 2176 KB Output is correct
63 Correct 369 ms 2176 KB Output is correct
64 Execution timed out 1092 ms 2776 KB Time limit exceeded
65 Halted 0 ms 0 KB -