oj.uz

Submission #601541

# Submission time Handle Problem Language Result Execution time Memory
601541 2022-07-22T07:40:12 Z pakhomovee Robot (JOI21_ho_t4) C++17
100 / 100
 953 ms 75416 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>

using namespace std;

#define int long long
const int maxn = 1e5;

map<int, vector<pair<int, int>>> g[maxn];
map<int, int> dist[maxn];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    set<pair<pair<int, int>, int>> s;
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v, c, p;
        cin >> u >> v >> c >> p;
        --u; --v;
        g[u][c].push_back({ v, p });
        g[v][c].push_back({ u, p });
    }
    dist[0][0] = 0;
    s.insert({ { 0, 0 }, 0 });
    auto upd = [&] (int u, int c, int d) {
        if (dist[u].count(c)) {
            if (dist[u][c] > d) {
                dist[u][c] = min(dist[u][c], d);
                s.insert({ { dist[u][c], u }, c });
            }
        } else {
            dist[u][c] = d;
            s.insert({ { dist[u][c], u }, c });
        }
    };
    while (!s.empty()) {
        int v = s.begin()->first.second;
        int c = s.begin()->second;
        int d = s.begin()->first.first;
        s.erase(s.begin());
        if (d > dist[v][c]) continue;
        if (c == 0) {
            for (auto [color, adjacent] : g[v]) {
                int sum = 0;
                for (auto [u, w] : adjacent) {
                    sum += w;
                }
                for (auto [u, w] : adjacent) {
                    upd(u, 0, d + min(w, sum - w));
                    upd(u, color, d);
                }
            }
        } else {
            int sum = 0;
            for (auto [u, w] : g[v][c]) {
                sum += w;
            }
            for (auto [u, w] : g[v][c]) {
                upd(u, 0, d + sum - w);
            }
        }
    }
    cout << (dist[n - 1].count(0) ? dist[n - 1][0] : -1);
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 7 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9692 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 5 ms 9716 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 5 ms 9724 KB Output is correct
9 Correct 9 ms 10196 KB Output is correct
10 Correct 7 ms 10244 KB Output is correct
11 Correct 6 ms 10080 KB Output is correct
12 Correct 6 ms 10068 KB Output is correct
13 Correct 8 ms 10196 KB Output is correct
14 Correct 7 ms 10324 KB Output is correct
15 Correct 6 ms 9984 KB Output is correct
16 Correct 10 ms 10076 KB Output is correct
17 Correct 6 ms 10080 KB Output is correct
18 Correct 5 ms 9812 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 27684 KB Output is correct
2 Correct 73 ms 18508 KB Output is correct
3 Correct 217 ms 27288 KB Output is correct
4 Correct 118 ms 21992 KB Output is correct
5 Correct 842 ms 69368 KB Output is correct
6 Correct 762 ms 63424 KB Output is correct
7 Correct 366 ms 57516 KB Output is correct
8 Correct 369 ms 45172 KB Output is correct
9 Correct 364 ms 45312 KB Output is correct
10 Correct 307 ms 37556 KB Output is correct
11 Correct 87 ms 22604 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 7 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9692 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 5 ms 9716 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 5 ms 9724 KB Output is correct
9 Correct 9 ms 10196 KB Output is correct
10 Correct 7 ms 10244 KB Output is correct
11 Correct 6 ms 10080 KB Output is correct
12 Correct 6 ms 10068 KB Output is correct
13 Correct 8 ms 10196 KB Output is correct
14 Correct 7 ms 10324 KB Output is correct
15 Correct 6 ms 9984 KB Output is correct
16 Correct 10 ms 10076 KB Output is correct
17 Correct 6 ms 10080 KB Output is correct
18 Correct 5 ms 9812 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct
21 Correct 188 ms 27684 KB Output is correct
22 Correct 73 ms 18508 KB Output is correct
23 Correct 217 ms 27288 KB Output is correct
24 Correct 118 ms 21992 KB Output is correct
25 Correct 842 ms 69368 KB Output is correct
26 Correct 762 ms 63424 KB Output is correct
27 Correct 366 ms 57516 KB Output is correct
28 Correct 369 ms 45172 KB Output is correct
29 Correct 364 ms 45312 KB Output is correct
30 Correct 307 ms 37556 KB Output is correct
31 Correct 87 ms 22604 KB Output is correct
32 Correct 139 ms 22732 KB Output is correct
33 Correct 192 ms 27212 KB Output is correct
34 Correct 392 ms 43596 KB Output is correct
35 Correct 286 ms 36816 KB Output is correct
36 Correct 325 ms 41724 KB Output is correct
37 Correct 366 ms 48868 KB Output is correct
38 Correct 408 ms 63492 KB Output is correct
39 Correct 146 ms 27048 KB Output is correct
40 Correct 355 ms 46572 KB Output is correct
41 Correct 399 ms 46868 KB Output is correct
42 Correct 455 ms 52360 KB Output is correct
43 Correct 182 ms 29004 KB Output is correct
44 Correct 325 ms 36088 KB Output is correct
45 Correct 277 ms 42116 KB Output is correct
46 Correct 229 ms 42224 KB Output is correct
47 Correct 316 ms 45272 KB Output is correct
48 Correct 953 ms 75416 KB Output is correct