oj.uz

Submission #482101

# Submission time Handle Problem Language Result Execution time Memory
482101 2021-10-23T07:10:33 Z Shin Robot (JOI21_ho_t4) C++14
100 / 100
 189 ms 26184 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace std;
const int N = 2e5 + 7;
const int MOD = 1e9 + 7; // 998244353;
const int INF = 1e9 + 7;
const long long INFLL = 1e18 + 7;

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

struct edge {
    int to, color;
    long long cost;
    edge() {}
    edge(int _to, int _color, long long _cost) {
        to = _to;
        color = _color;
        cost = _cost;
    }
};

int n, m;
long long dist[N];
long long sum[N];
long long best[N];

vector<edge> adj[N];

void solve(void) {
    cin >> n >> m;
    for (int i = 1; i <= m; i ++) {
        int u, v, c, w;
        cin >> u >> v >> c >> w;
        adj[u].emplace_back(v, c, w);
        adj[v].emplace_back(u, c, w);
    }       

    memset(dist, 0x3f, sizeof dist);
    memset(best, 0x3f, sizeof best);
    priority_queue<pair<long long, int>> heap;
    dist[1] = 0;
    heap.emplace(0, 1);

    while (!heap.empty()) {
        int u; long long d_u;
        tie(d_u, u) = heap.top();
        heap.pop();
        d_u = -d_u;

        if (d_u != dist[u]) continue;

        for (edge x: adj[u]) {
            sum[x.color] += x.cost;
            minimize(best[x.color], dist[x.to]);
        }

        for (edge x: adj[u]) {
            if (minimize(dist[x.to], d_u + min(1LL * x.cost, sum[x.color] - x.cost))) {
                heap.emplace(-dist[x.to], x.to);
            }
            if (minimize(dist[x.to], best[x.color] + sum[x.color] - x.cost)) {
                heap.emplace(-dist[x.to], x.to);
            }
        }

        for (edge x: adj[u]) {
            sum[x.color] = 0;
            best[x.color] = INFLL;
        }
    }

    cout << (dist[n] < INFLL ? dist[n] : -1);
}

int main(void) {
    cin.tie(0)->sync_with_stdio(0); 
    int test = 1;
    // cin >> test;
    while (test --) {
        solve();
    }
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8140 KB Output is correct
2 Correct 4 ms 8140 KB Output is correct
3 Correct 3 ms 8140 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 4 ms 8140 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8140 KB Output is correct
9 Correct 4 ms 8268 KB Output is correct
10 Correct 6 ms 8268 KB Output is correct
11 Correct 5 ms 8268 KB Output is correct
12 Correct 4 ms 8268 KB Output is correct
13 Correct 4 ms 8268 KB Output is correct
14 Correct 5 ms 8268 KB Output is correct
15 Correct 4 ms 8140 KB Output is correct
16 Correct 5 ms 8268 KB Output is correct
17 Correct 5 ms 8272 KB Output is correct
18 Correct 4 ms 8140 KB Output is correct
19 Correct 5 ms 8396 KB Output is correct
20 Correct 6 ms 8268 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 12512 KB Output is correct
2 Correct 20 ms 10188 KB Output is correct
3 Correct 62 ms 15628 KB Output is correct
4 Correct 31 ms 11232 KB Output is correct
5 Correct 123 ms 21144 KB Output is correct
6 Correct 135 ms 25496 KB Output is correct
7 Correct 114 ms 23668 KB Output is correct
8 Correct 148 ms 22548 KB Output is correct
9 Correct 146 ms 22496 KB Output is correct
10 Correct 69 ms 17296 KB Output is correct
11 Correct 51 ms 14988 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8140 KB Output is correct
2 Correct 4 ms 8140 KB Output is correct
3 Correct 3 ms 8140 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 4 ms 8140 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8140 KB Output is correct
9 Correct 4 ms 8268 KB Output is correct
10 Correct 6 ms 8268 KB Output is correct
11 Correct 5 ms 8268 KB Output is correct
12 Correct 4 ms 8268 KB Output is correct
13 Correct 4 ms 8268 KB Output is correct
14 Correct 5 ms 8268 KB Output is correct
15 Correct 4 ms 8140 KB Output is correct
16 Correct 5 ms 8268 KB Output is correct
17 Correct 5 ms 8272 KB Output is correct
18 Correct 4 ms 8140 KB Output is correct
19 Correct 5 ms 8396 KB Output is correct
20 Correct 6 ms 8268 KB Output is correct
21 Correct 50 ms 12512 KB Output is correct
22 Correct 20 ms 10188 KB Output is correct
23 Correct 62 ms 15628 KB Output is correct
24 Correct 31 ms 11232 KB Output is correct
25 Correct 123 ms 21144 KB Output is correct
26 Correct 135 ms 25496 KB Output is correct
27 Correct 114 ms 23668 KB Output is correct
28 Correct 148 ms 22548 KB Output is correct
29 Correct 146 ms 22496 KB Output is correct
30 Correct 69 ms 17296 KB Output is correct
31 Correct 51 ms 14988 KB Output is correct
32 Correct 64 ms 19024 KB Output is correct
33 Correct 70 ms 17364 KB Output is correct
34 Correct 93 ms 20116 KB Output is correct
35 Correct 77 ms 18268 KB Output is correct
36 Correct 98 ms 18104 KB Output is correct
37 Correct 126 ms 20944 KB Output is correct
38 Correct 110 ms 23228 KB Output is correct
39 Correct 94 ms 22256 KB Output is correct
40 Correct 155 ms 23960 KB Output is correct
41 Correct 189 ms 24020 KB Output is correct
42 Correct 144 ms 23104 KB Output is correct
43 Correct 60 ms 16176 KB Output is correct
44 Correct 100 ms 24332 KB Output is correct
45 Correct 118 ms 19940 KB Output is correct
46 Correct 102 ms 19440 KB Output is correct
47 Correct 119 ms 20524 KB Output is correct
48 Correct 140 ms 26184 KB Output is correct