oj.uz

Submission #917952

# Submission time Handle Problem Language Result Execution time Memory
917952 2024-01-29T07:39:16 Z 406 Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 89844 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);
        queue<int> q;
        q.push(0);
        while (q.size()) {
                int v = q.front();
                q.pop();
                for (auto [u, c, p]: adj[v]) {
                        int w = d[v] + p;
                        if (w < d[u]) {
                                q.push(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 18268 KB Output is correct
2 Correct 5 ms 18488 KB Output is correct
3 Correct 5 ms 18268 KB Output is correct
4 Correct 5 ms 18268 KB Output is correct
5 Correct 5 ms 18524 KB Output is correct
6 Correct 5 ms 18516 KB Output is correct
7 Correct 6 ms 18776 KB Output is correct
8 Correct 5 ms 18524 KB Output is correct
9 Correct 6 ms 18912 KB Output is correct
10 Correct 7 ms 18912 KB Output is correct
11 Correct 8 ms 18904 KB Output is correct
12 Correct 6 ms 19004 KB Output is correct
13 Correct 6 ms 18912 KB Output is correct
14 Correct 6 ms 18908 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 18976 KB Output is correct
18 Correct 5 ms 18524 KB Output is correct
19 Correct 6 ms 19160 KB Output is correct
20 Correct 6 ms 18908 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 45488 KB Output is correct
2 Correct 38 ms 30292 KB Output is correct
3 Correct 115 ms 64332 KB Output is correct
4 Correct 64 ms 35624 KB Output is correct
5 Correct 216 ms 81924 KB Output is correct
6 Correct 207 ms 88368 KB Output is correct
7 Correct 168 ms 84504 KB Output is correct
8 Correct 312 ms 87968 KB Output is correct
9 Correct 277 ms 88148 KB Output is correct
10 Correct 171 ms 61352 KB Output is correct
11 Correct 92 ms 52068 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18268 KB Output is correct
2 Correct 5 ms 18488 KB Output is correct
3 Correct 5 ms 18268 KB Output is correct
4 Correct 5 ms 18268 KB Output is correct
5 Correct 5 ms 18524 KB Output is correct
6 Correct 5 ms 18516 KB Output is correct
7 Correct 6 ms 18776 KB Output is correct
8 Correct 5 ms 18524 KB Output is correct
9 Correct 6 ms 18912 KB Output is correct
10 Correct 7 ms 18912 KB Output is correct
11 Correct 8 ms 18904 KB Output is correct
12 Correct 6 ms 19004 KB Output is correct
13 Correct 6 ms 18912 KB Output is correct
14 Correct 6 ms 18908 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 18976 KB Output is correct
18 Correct 5 ms 18524 KB Output is correct
19 Correct 6 ms 19160 KB Output is correct
20 Correct 6 ms 18908 KB Output is correct
21 Correct 84 ms 45488 KB Output is correct
22 Correct 38 ms 30292 KB Output is correct
23 Correct 115 ms 64332 KB Output is correct
24 Correct 64 ms 35624 KB Output is correct
25 Correct 216 ms 81924 KB Output is correct
26 Correct 207 ms 88368 KB Output is correct
27 Correct 168 ms 84504 KB Output is correct
28 Correct 312 ms 87968 KB Output is correct
29 Correct 277 ms 88148 KB Output is correct
30 Correct 171 ms 61352 KB Output is correct
31 Correct 92 ms 52068 KB Output is correct
32 Correct 115 ms 71796 KB Output is correct
33 Correct 120 ms 59728 KB Output is correct
34 Correct 338 ms 72200 KB Output is correct
35 Correct 220 ms 59556 KB Output is correct
36 Correct 144 ms 58772 KB Output is correct
37 Correct 164 ms 75348 KB Output is correct
38 Correct 189 ms 83596 KB Output is correct
39 Correct 173 ms 83388 KB Output is correct
40 Execution timed out 3052 ms 89844 KB Time limit exceeded
41 Halted 0 ms 0 KB -