oj.uz

Submission #917956

# Submission time Handle Problem Language Result Execution time Memory
917956 2024-01-29T07:44:30 Z 406 Robot (JOI21_ho_t4) C++17
100 / 100
 330 ms 142524 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 = 2e6 + 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 20 ms 68700 KB Output is correct
2 Correct 18 ms 68696 KB Output is correct
3 Correct 19 ms 68696 KB Output is correct
4 Correct 18 ms 68700 KB Output is correct
5 Correct 18 ms 68768 KB Output is correct
6 Correct 20 ms 68760 KB Output is correct
7 Correct 19 ms 68952 KB Output is correct
8 Correct 19 ms 68700 KB Output is correct
9 Correct 20 ms 69344 KB Output is correct
10 Correct 22 ms 69600 KB Output is correct
11 Correct 20 ms 69208 KB Output is correct
12 Correct 20 ms 69084 KB Output is correct
13 Correct 21 ms 69224 KB Output is correct
14 Correct 21 ms 69336 KB Output is correct
15 Correct 19 ms 69208 KB Output is correct
16 Correct 21 ms 69344 KB Output is correct
17 Correct 21 ms 69080 KB Output is correct
18 Correct 19 ms 68956 KB Output is correct
19 Correct 20 ms 69336 KB Output is correct
20 Correct 19 ms 69164 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 97556 KB Output is correct
2 Correct 58 ms 80552 KB Output is correct
3 Correct 134 ms 118452 KB Output is correct
4 Correct 91 ms 86080 KB Output is correct
5 Correct 297 ms 133880 KB Output is correct
6 Correct 255 ms 137652 KB Output is correct
7 Correct 196 ms 136696 KB Output is correct
8 Correct 329 ms 133796 KB Output is correct
9 Correct 330 ms 134188 KB Output is correct
10 Correct 206 ms 109224 KB Output is correct
11 Correct 100 ms 99496 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 68700 KB Output is correct
2 Correct 18 ms 68696 KB Output is correct
3 Correct 19 ms 68696 KB Output is correct
4 Correct 18 ms 68700 KB Output is correct
5 Correct 18 ms 68768 KB Output is correct
6 Correct 20 ms 68760 KB Output is correct
7 Correct 19 ms 68952 KB Output is correct
8 Correct 19 ms 68700 KB Output is correct
9 Correct 20 ms 69344 KB Output is correct
10 Correct 22 ms 69600 KB Output is correct
11 Correct 20 ms 69208 KB Output is correct
12 Correct 20 ms 69084 KB Output is correct
13 Correct 21 ms 69224 KB Output is correct
14 Correct 21 ms 69336 KB Output is correct
15 Correct 19 ms 69208 KB Output is correct
16 Correct 21 ms 69344 KB Output is correct
17 Correct 21 ms 69080 KB Output is correct
18 Correct 19 ms 68956 KB Output is correct
19 Correct 20 ms 69336 KB Output is correct
20 Correct 19 ms 69164 KB Output is correct
21 Correct 119 ms 97556 KB Output is correct
22 Correct 58 ms 80552 KB Output is correct
23 Correct 134 ms 118452 KB Output is correct
24 Correct 91 ms 86080 KB Output is correct
25 Correct 297 ms 133880 KB Output is correct
26 Correct 255 ms 137652 KB Output is correct
27 Correct 196 ms 136696 KB Output is correct
28 Correct 329 ms 133796 KB Output is correct
29 Correct 330 ms 134188 KB Output is correct
30 Correct 206 ms 109224 KB Output is correct
31 Correct 100 ms 99496 KB Output is correct
32 Correct 107 ms 119640 KB Output is correct
33 Correct 121 ms 109368 KB Output is correct
34 Correct 232 ms 118432 KB Output is correct
35 Correct 167 ms 111192 KB Output is correct
36 Correct 207 ms 107580 KB Output is correct
37 Correct 236 ms 122120 KB Output is correct
38 Correct 217 ms 139368 KB Output is correct
39 Correct 143 ms 131488 KB Output is correct
40 Correct 315 ms 133796 KB Output is correct
41 Correct 321 ms 133884 KB Output is correct
42 Correct 313 ms 129436 KB Output is correct
43 Correct 114 ms 103552 KB Output is correct
44 Correct 193 ms 141812 KB Output is correct
45 Correct 254 ms 117144 KB Output is correct
46 Correct 221 ms 113056 KB Output is correct
47 Correct 232 ms 116992 KB Output is correct
48 Correct 314 ms 142524 KB Output is correct