oj.uz

Submission #917953

# Submission time Handle Problem Language Result Execution time Memory
917953 2024-01-29T07:40:53 Z 406 Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 93492 KB 
#include <bits/stdc++.h>
#define int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;
using ar3 = array<int, 3>;

const int64_t INF = 1ll << 60;
const int N = 4e5 + 5;

vector<ar3> adj[N];
int n, m, C[N], d[N], sum[N], P[N];
bool cnt[N];

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> m;
        FOR(i, 0, m) {
                int u, v, c, p;
                cin >> u >> v >> c >> p;
                --u, --v;
                adj[v].push_back({u, c, p});
                adj[u].push_back({v, c, p});
        }
        int ptr = n - 1;
        vector<array<int, 4>> E;
        FOR(i, 0, n) {
                for (auto [u, c, p]: adj[i]) {
                        P[c] = (cnt[c] ? P[c] : ++ptr);
                        cnt[c] = true;
                        sum[c] += p;
                }
                /*
                for (auto &[u, c, p]: adj[i]) for (auto &[v, cv, pv]: adj[i]) if (cv == c && (u != v)) {
                        E.push_back({u, v, c, sum[c] - pv});
                }
                */
                for (auto [u, c, p]: adj[i]) {
                      E.push_back({u, P[c], c, 0});            
                      E.push_back({P[c], u, c, sum[c] - p});            
                }
                for (auto &[u, c, p]: adj[i]) {
                        p = min(p, sum[c] - p);
                        cnt[c] = 0;
                }
                for (auto [u, c, p]: adj[i]) sum[c] = 0;
        }
        for (auto [u, v, c, p]: E)
                adj[u].push_back({v, c, p});

        fill(d + 1, d + N, INF);
        priority_queue<ar> q;
        q.push({0, 0});
        while (q.size()) {
                auto [dist, v] = q.top();
                q.pop();
                if (dist > d[v]) continue;

                for (auto [u, c, p]: adj[v]) {
                        int w = d[v] + p;
                        if (w < d[u]) {
                                q.push({-w, u});
                                d[u] = w;
                        }
                }
        }
        cout << (d[n - 1] < INF ? d[n - 1] : -1) << '\n';
        return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18480 KB Output is correct
2 Correct 6 ms 18268 KB Output is correct
3 Correct 5 ms 18476 KB Output is correct
4 Correct 6 ms 18448 KB Output is correct
5 Correct 5 ms 18524 KB Output is correct
6 Correct 5 ms 18280 KB Output is correct
7 Correct 6 ms 18780 KB Output is correct
8 Correct 6 ms 18624 KB Output is correct
9 Correct 6 ms 19000 KB Output is correct
10 Correct 6 ms 18912 KB Output is correct
11 Correct 7 ms 18908 KB Output is correct
12 Correct 6 ms 19024 KB Output is correct
13 Correct 6 ms 19168 KB Output is correct
14 Correct 6 ms 19096 KB Output is correct
15 Correct 6 ms 18780 KB Output is correct
16 Correct 7 ms 18912 KB Output is correct
17 Correct 6 ms 18904 KB Output is correct
18 Correct 6 ms 18524 KB Output is correct
19 Correct 6 ms 19160 KB Output is correct
20 Correct 6 ms 18904 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 45712 KB Output is correct
2 Correct 40 ms 31684 KB Output is correct
3 Correct 120 ms 65256 KB Output is correct
4 Correct 64 ms 36292 KB Output is correct
5 Correct 266 ms 85160 KB Output is correct
6 Correct 258 ms 85804 KB Output is correct
7 Correct 204 ms 85948 KB Output is correct
8 Correct 345 ms 83796 KB Output is correct
9 Correct 316 ms 83768 KB Output is correct
10 Correct 167 ms 60012 KB Output is correct
11 Correct 86 ms 50600 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18480 KB Output is correct
2 Correct 6 ms 18268 KB Output is correct
3 Correct 5 ms 18476 KB Output is correct
4 Correct 6 ms 18448 KB Output is correct
5 Correct 5 ms 18524 KB Output is correct
6 Correct 5 ms 18280 KB Output is correct
7 Correct 6 ms 18780 KB Output is correct
8 Correct 6 ms 18624 KB Output is correct
9 Correct 6 ms 19000 KB Output is correct
10 Correct 6 ms 18912 KB Output is correct
11 Correct 7 ms 18908 KB Output is correct
12 Correct 6 ms 19024 KB Output is correct
13 Correct 6 ms 19168 KB Output is correct
14 Correct 6 ms 19096 KB Output is correct
15 Correct 6 ms 18780 KB Output is correct
16 Correct 7 ms 18912 KB Output is correct
17 Correct 6 ms 18904 KB Output is correct
18 Correct 6 ms 18524 KB Output is correct
19 Correct 6 ms 19160 KB Output is correct
20 Correct 6 ms 18904 KB Output is correct
21 Correct 103 ms 45712 KB Output is correct
22 Correct 40 ms 31684 KB Output is correct
23 Correct 120 ms 65256 KB Output is correct
24 Correct 64 ms 36292 KB Output is correct
25 Correct 266 ms 85160 KB Output is correct
26 Correct 258 ms 85804 KB Output is correct
27 Correct 204 ms 85948 KB Output is correct
28 Correct 345 ms 83796 KB Output is correct
29 Correct 316 ms 83768 KB Output is correct
30 Correct 167 ms 60012 KB Output is correct
31 Correct 86 ms 50600 KB Output is correct
32 Correct 103 ms 67800 KB Output is correct
33 Correct 129 ms 59556 KB Output is correct
34 Correct 223 ms 70380 KB Output is correct
35 Correct 160 ms 59464 KB Output is correct
36 Correct 179 ms 57228 KB Output is correct
37 Correct 203 ms 72212 KB Output is correct
38 Correct 205 ms 92280 KB Output is correct
39 Correct 150 ms 81972 KB Output is correct
40 Correct 287 ms 84128 KB Output is correct
41 Correct 307 ms 88536 KB Output is correct
42 Correct 295 ms 82848 KB Output is correct
43 Correct 126 ms 52648 KB Output is correct
44 Correct 201 ms 93492 KB Output is correct
45 Correct 252 ms 71936 KB Output is correct
46 Correct 204 ms 67472 KB Output is correct
47 Execution timed out 3033 ms 70784 KB Time limit exceeded
48 Halted 0 ms 0 KB -