oj.uz

Submission #917955

# Submission time Handle Problem Language Result Execution time Memory
917955 2024-01-29T07:43:03 Z 406 Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 105340 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 = 8e5 + 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 9 ms 32348 KB Output is correct
2 Correct 8 ms 32348 KB Output is correct
3 Correct 10 ms 32348 KB Output is correct
4 Correct 9 ms 32424 KB Output is correct
5 Correct 9 ms 32600 KB Output is correct
6 Correct 9 ms 32600 KB Output is correct
7 Correct 9 ms 32856 KB Output is correct
8 Correct 9 ms 32604 KB Output is correct
9 Correct 11 ms 33088 KB Output is correct
10 Correct 10 ms 33244 KB Output is correct
11 Correct 10 ms 33176 KB Output is correct
12 Correct 12 ms 33140 KB Output is correct
13 Correct 11 ms 33248 KB Output is correct
14 Correct 11 ms 33244 KB Output is correct
15 Correct 9 ms 32860 KB Output is correct
16 Correct 12 ms 33248 KB Output is correct
17 Correct 10 ms 32988 KB Output is correct
18 Correct 11 ms 32604 KB Output is correct
19 Correct 10 ms 33240 KB Output is correct
20 Correct 11 ms 33044 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 59836 KB Output is correct
2 Correct 65 ms 44484 KB Output is correct
3 Correct 129 ms 78764 KB Output is correct
4 Correct 77 ms 50656 KB Output is correct
5 Correct 312 ms 99636 KB Output is correct
6 Correct 258 ms 100128 KB Output is correct
7 Correct 203 ms 98436 KB Output is correct
8 Correct 338 ms 98492 KB Output is correct
9 Correct 297 ms 98820 KB Output is correct
10 Correct 207 ms 73112 KB Output is correct
11 Correct 100 ms 63372 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 32348 KB Output is correct
2 Correct 8 ms 32348 KB Output is correct
3 Correct 10 ms 32348 KB Output is correct
4 Correct 9 ms 32424 KB Output is correct
5 Correct 9 ms 32600 KB Output is correct
6 Correct 9 ms 32600 KB Output is correct
7 Correct 9 ms 32856 KB Output is correct
8 Correct 9 ms 32604 KB Output is correct
9 Correct 11 ms 33088 KB Output is correct
10 Correct 10 ms 33244 KB Output is correct
11 Correct 10 ms 33176 KB Output is correct
12 Correct 12 ms 33140 KB Output is correct
13 Correct 11 ms 33248 KB Output is correct
14 Correct 11 ms 33244 KB Output is correct
15 Correct 9 ms 32860 KB Output is correct
16 Correct 12 ms 33248 KB Output is correct
17 Correct 10 ms 32988 KB Output is correct
18 Correct 11 ms 32604 KB Output is correct
19 Correct 10 ms 33240 KB Output is correct
20 Correct 11 ms 33044 KB Output is correct
21 Correct 115 ms 59836 KB Output is correct
22 Correct 65 ms 44484 KB Output is correct
23 Correct 129 ms 78764 KB Output is correct
24 Correct 77 ms 50656 KB Output is correct
25 Correct 312 ms 99636 KB Output is correct
26 Correct 258 ms 100128 KB Output is correct
27 Correct 203 ms 98436 KB Output is correct
28 Correct 338 ms 98492 KB Output is correct
29 Correct 297 ms 98820 KB Output is correct
30 Correct 207 ms 73112 KB Output is correct
31 Correct 100 ms 63372 KB Output is correct
32 Correct 121 ms 80316 KB Output is correct
33 Correct 128 ms 72612 KB Output is correct
34 Correct 221 ms 82340 KB Output is correct
35 Correct 189 ms 74296 KB Output is correct
36 Correct 205 ms 71708 KB Output is correct
37 Correct 205 ms 87640 KB Output is correct
38 Correct 233 ms 105092 KB Output is correct
39 Correct 147 ms 95512 KB Output is correct
40 Correct 386 ms 97668 KB Output is correct
41 Correct 340 ms 98464 KB Output is correct
42 Correct 305 ms 91808 KB Output is correct
43 Correct 107 ms 65544 KB Output is correct
44 Correct 203 ms 105340 KB Output is correct
45 Correct 234 ms 82340 KB Output is correct
46 Correct 207 ms 76588 KB Output is correct
47 Execution timed out 3047 ms 81428 KB Time limit exceeded
48 Halted 0 ms 0 KB -