Submission #937921

# Submission time Handle Problem Language Result Execution time Memory
937921 2024-03-04T16:45:27 Z zwezdinv Robot (JOI21_ho_t4) C++17
100 / 100
1197 ms 94332 KB
#include <bits/stdc++.h>


int main() {
        std::cin.tie(nullptr)->sync_with_stdio(false);

        int n, m;
        std::cin >> n >> m;
        std::vector<std::map<int, std::vector<std::pair<int, long long>>>> g(n);
        std::vector<std::map<int, long long>> mp(n);
        for (int i = 0; i < m; ++i) {
                int u, v, c;
                long long p;
                std::cin >> u >> v >> c >> p;
                --u, --v;
                mp[u][c] += p;
                mp[v][c] += p;
                g[u][c].emplace_back(v, p);
                g[v][c].emplace_back(u, p);
        }
        std::vector<std::map<int, long long>> dist(n);
        for (int i = 0; i < n; ++i) {
                dist[i][0] = 1e18;
                for (auto [j, val] : mp[i]) dist[i][j] = 1e18;
        }
        dist[0][0] = 0;
        std::set<std::pair<long long, std::pair<int, int>>> st;
        st.emplace(0, std::make_pair(0, 0));
        while (st.size()) {
                auto [u, c] = st.begin()->second;
                st.erase(st.begin());
                if (c == 0) {
                        for (auto& [col, v] : g[u]) {
                                for (auto& [to, cost] : v) {
                                        {
                                                long long w = dist[u][0] + std::min(cost, mp[u][col] - cost);
                                                if (dist[to][0] > w) {
                                                        st.erase({dist[to][0], {to, 0}});
                                                        dist[to][0] = w;
                                                        st.insert({dist[to][0], {to, 0}});
                                                }
                                        }
                                        {
                                                long long w = dist[u][0];
                                                if (dist[to][col] > w) {
                                                        st.erase({dist[to][col], {to, col}});
                                                        dist[to][col] = w;
                                                        st.insert({dist[to][col], {to, col}});
                                                }
                                        }
                                }
                        }
                } else {
                        for (auto& [to, cost] : g[u][c]) {
                                long long w = dist[u][c] + mp[u][c] - cost;
                                if (dist[to][0] > w) {
                                        st.erase({dist[to][0], {to, 0}});
                                        dist[to][0] = w;
                                        st.insert({dist[to][0], {to, 0}});
                                }
                        }
                }
        }
        long long ans = dist[n - 1][0];
        if (ans == 1e18) std::cout << -1;
        else std::cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 2 ms 864 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 166 ms 25940 KB Output is correct
2 Correct 54 ms 13976 KB Output is correct
3 Correct 138 ms 20480 KB Output is correct
4 Correct 86 ms 19028 KB Output is correct
5 Correct 1022 ms 91424 KB Output is correct
6 Correct 799 ms 80572 KB Output is correct
7 Correct 358 ms 66848 KB Output is correct
8 Correct 335 ms 56400 KB Output is correct
9 Correct 348 ms 56760 KB Output is correct
10 Correct 272 ms 47696 KB Output is correct
11 Correct 109 ms 39988 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 2 ms 864 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 166 ms 25940 KB Output is correct
22 Correct 54 ms 13976 KB Output is correct
23 Correct 138 ms 20480 KB Output is correct
24 Correct 86 ms 19028 KB Output is correct
25 Correct 1022 ms 91424 KB Output is correct
26 Correct 799 ms 80572 KB Output is correct
27 Correct 358 ms 66848 KB Output is correct
28 Correct 335 ms 56400 KB Output is correct
29 Correct 348 ms 56760 KB Output is correct
30 Correct 272 ms 47696 KB Output is correct
31 Correct 109 ms 39988 KB Output is correct
32 Correct 106 ms 14036 KB Output is correct
33 Correct 150 ms 18768 KB Output is correct
34 Correct 355 ms 45140 KB Output is correct
35 Correct 307 ms 36420 KB Output is correct
36 Correct 328 ms 54588 KB Output is correct
37 Correct 388 ms 58816 KB Output is correct
38 Correct 425 ms 66664 KB Output is correct
39 Correct 98 ms 18256 KB Output is correct
40 Correct 352 ms 57556 KB Output is correct
41 Correct 410 ms 57940 KB Output is correct
42 Correct 488 ms 68564 KB Output is correct
43 Correct 164 ms 29512 KB Output is correct
44 Correct 300 ms 30548 KB Output is correct
45 Correct 291 ms 53072 KB Output is correct
46 Correct 239 ms 53328 KB Output is correct
47 Correct 334 ms 58596 KB Output is correct
48 Correct 1197 ms 94332 KB Output is correct