oj.uz

Submission #956686

# Submission time Handle Problem Language Result Execution time Memory
956686 2024-04-02T10:25:59 Z peterandvoi Robot (JOI21_ho_t4) C++17
100 / 100
 738 ms 78248 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = (int) 5e5 + 5;

int n, m;
long long s[N], d[N];
vector<pair<int, long long>> g[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    cin >> n >> m;
    map<pair<int, int>, int> id;
    vector<tuple<int, int, int, int>> edges;
    int idx = n;
    auto add = [&](int u, int c, int v) {
        if (!id.count({u, c})) {
            id[{u, c}] = ++idx;
        }
        s[id[{u, c}]] += v;
    };
    for (int i = 1; i <= m; ++i) {
        int u, v, c, p;
        cin >> u >> v >> c >> p;
        edges.emplace_back(u, v, c, p);
        add(u, c, p);
        add(v, c, p);
    }
    for (auto [u, v, c, p] : edges) {
        int x = id[{u, c}], y = id[{v, c}];
        long long a = s[x], b = s[y];
        g[u].emplace_back(v, min(1LL * p, a - p));
        g[v].emplace_back(u, min(1LL * p, b - p));
        g[u].emplace_back(y, 0);
        g[v].emplace_back(x, 0);
        g[x].emplace_back(v, a - p);
        g[y].emplace_back(u, b - p);
    }
    memset(d, 0x3f, sizeof(d));
    using T = pair<long long, int>;
    priority_queue<T, vector<T>, greater<T>> pq;
    d[1] = 0;
    pq.emplace(0, 1);
    while (pq.size()) {
        auto [c, u] = pq.top();
        pq.pop();
        if (c == d[u]) {
            for (auto [v, w] : g[u]) {
                if (d[v] > d[u] + w) {
                    pq.emplace(d[v] = d[u] + w, v);
                }
            }
        }
    }
    const long long INF = (long long) 1e18;
    cout << (d[n] > INF ? -1 : d[n]);
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 6 ms 17044 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 5 ms 17244 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 7 ms 17500 KB Output is correct
10 Correct 6 ms 17752 KB Output is correct
11 Correct 5 ms 17476 KB Output is correct
12 Correct 5 ms 17244 KB Output is correct
13 Correct 5 ms 17344 KB Output is correct
14 Correct 6 ms 17500 KB Output is correct
15 Correct 5 ms 17052 KB Output is correct
16 Correct 6 ms 17240 KB Output is correct
17 Correct 6 ms 17236 KB Output is correct
18 Correct 4 ms 17140 KB Output is correct
19 Correct 5 ms 17496 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 35388 KB Output is correct
2 Correct 68 ms 26136 KB Output is correct
3 Correct 209 ms 45876 KB Output is correct
4 Correct 102 ms 30264 KB Output is correct
5 Correct 738 ms 73204 KB Output is correct
6 Correct 553 ms 74736 KB Output is correct
7 Correct 317 ms 67772 KB Output is correct
8 Correct 533 ms 62588 KB Output is correct
9 Correct 528 ms 61716 KB Output is correct
10 Correct 309 ms 50880 KB Output is correct
11 Correct 179 ms 40480 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 6 ms 17044 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 5 ms 17244 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 7 ms 17500 KB Output is correct
10 Correct 6 ms 17752 KB Output is correct
11 Correct 5 ms 17476 KB Output is correct
12 Correct 5 ms 17244 KB Output is correct
13 Correct 5 ms 17344 KB Output is correct
14 Correct 6 ms 17500 KB Output is correct
15 Correct 5 ms 17052 KB Output is correct
16 Correct 6 ms 17240 KB Output is correct
17 Correct 6 ms 17236 KB Output is correct
18 Correct 4 ms 17140 KB Output is correct
19 Correct 5 ms 17496 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 168 ms 35388 KB Output is correct
22 Correct 68 ms 26136 KB Output is correct
23 Correct 209 ms 45876 KB Output is correct
24 Correct 102 ms 30264 KB Output is correct
25 Correct 738 ms 73204 KB Output is correct
26 Correct 553 ms 74736 KB Output is correct
27 Correct 317 ms 67772 KB Output is correct
28 Correct 533 ms 62588 KB Output is correct
29 Correct 528 ms 61716 KB Output is correct
30 Correct 309 ms 50880 KB Output is correct
31 Correct 179 ms 40480 KB Output is correct
32 Correct 178 ms 45524 KB Output is correct
33 Correct 176 ms 42588 KB Output is correct
34 Correct 367 ms 55124 KB Output is correct
35 Correct 270 ms 48064 KB Output is correct
36 Correct 289 ms 49336 KB Output is correct
37 Correct 378 ms 59404 KB Output is correct
38 Correct 330 ms 65848 KB Output is correct
39 Correct 216 ms 55376 KB Output is correct
40 Correct 507 ms 63332 KB Output is correct
41 Correct 524 ms 63232 KB Output is correct
42 Correct 543 ms 64908 KB Output is correct
43 Correct 200 ms 40276 KB Output is correct
44 Correct 345 ms 62132 KB Output is correct
45 Correct 386 ms 54192 KB Output is correct
46 Correct 345 ms 52504 KB Output is correct
47 Correct 316 ms 55096 KB Output is correct
48 Correct 736 ms 78248 KB Output is correct