oj.uz

Submission #388327

# Submission time Handle Problem Language Result Execution time Memory
388327 2021-04-10T22:54:08 Z Kepha Robot (JOI21_ho_t4) C++11
100 / 100
 1121 ms 79892 KB 
// JOI 2021 Robot
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define MX 100000
using namespace std;
/*
struct Edge {
    int color, next;
    ll price;

    Edge (int _color = 0, int _next = 0, ll _price = 0) {
        color = _color, next = _next, price = _price;
    }
};
*/
struct Node {
    ll dist;
    int color, cur;

    Node (ll _dist = 0, int _color = 0, int _cur = 0) {
        dist = _dist, color = _color, cur = _cur;
    }

    bool operator<(const Node& x) const { return dist > x.dist; }
};

int N, M;
map<int, vector<pair<int, ll> > > adj[MX + 1];
map<int, ll> sum[MX + 1], dist2[MX + 1];
ll dist1[MX + 1];
priority_queue<Node> q;

int main() {
    cin >> N >> M;

    for (int i = 1; i <= M; i++) {
        int a, b, c;
        ll d; 
        cin >> a >> b >> c >> d;

        adj[a][c].push_back({b, d});
        adj[b][c].push_back({a, d});   
        sum[a][c] += d;
        sum[b][c] += d;
    }

    fill(dist1 + 1, dist1 + 1 + N, INF);
    dist1[1] = 0;
    q.push(Node(0, 0, 1));

    while (q.size()) {
        int cur = q.top().cur, color = q.top().color;
        ll dist = q.top().dist;
        q.pop();
        
        if (color) {
            if (dist != dist2[cur][color]) continue;
            for (auto& edge : adj[cur][color]) {
                ll cost = sum[cur][color] - edge.second;
                if (cost + dist < dist1[edge.first]) {
                    dist1[edge.first] = cost + dist;
                    q.push(Node(cost + dist, 0, edge.first));
                }
            }
        }
        else {
            if (dist != dist1[cur]) continue;
            for (auto& c : adj[cur]) {
                for (auto& edge : c.second) {
                    ll cost1 = edge.second;
                    if (cost1 + dist < dist1[edge.first]) {
                        dist1[edge.first] = cost1 + dist;
                        q.push(Node(dist1[edge.first], 0, edge.first));
                    }

                    ll cost2 = sum[cur][c.first] - edge.second;
                    if (cost2 + dist < dist1[edge.first]) {
                        dist1[edge.first] = cost2 + dist;
                        q.push(Node(dist1[edge.first], 0, edge.first));
                    }

                    if (dist2[edge.first].count(c.first) == 0
                        || dist < dist2[edge.first][c.first]) {

                        dist2[edge.first][c.first] = dist;
                        
                        q.push(Node(dist2[edge.first][c.first], c.first, edge.first));
                    }
                }
            }
        }
    }

    if (dist1[N] >= INF) cout << "-1\n";
    else cout << dist1[N] << "\n";

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 9 ms 14384 KB Output is correct
4 Correct 8 ms 14284 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 8 ms 14364 KB Output is correct
7 Correct 10 ms 14568 KB Output is correct
8 Correct 9 ms 14360 KB Output is correct
9 Correct 13 ms 14928 KB Output is correct
10 Correct 12 ms 14924 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 10 ms 14604 KB Output is correct
13 Correct 11 ms 14760 KB Output is correct
14 Correct 11 ms 14656 KB Output is correct
15 Correct 10 ms 14668 KB Output is correct
16 Correct 12 ms 14828 KB Output is correct
17 Correct 11 ms 14668 KB Output is correct
18 Correct 9 ms 14472 KB Output is correct
19 Correct 11 ms 14540 KB Output is correct
20 Correct 10 ms 14668 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 32812 KB Output is correct
2 Correct 106 ms 23920 KB Output is correct
3 Correct 315 ms 29212 KB Output is correct
4 Correct 158 ms 26684 KB Output is correct
5 Correct 1093 ms 79524 KB Output is correct
6 Correct 878 ms 68088 KB Output is correct
7 Correct 491 ms 48180 KB Output is correct
8 Correct 572 ms 46920 KB Output is correct
9 Correct 583 ms 46724 KB Output is correct
10 Correct 431 ms 45428 KB Output is correct
11 Correct 208 ms 30716 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 9 ms 14384 KB Output is correct
4 Correct 8 ms 14284 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 8 ms 14364 KB Output is correct
7 Correct 10 ms 14568 KB Output is correct
8 Correct 9 ms 14360 KB Output is correct
9 Correct 13 ms 14928 KB Output is correct
10 Correct 12 ms 14924 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 10 ms 14604 KB Output is correct
13 Correct 11 ms 14760 KB Output is correct
14 Correct 11 ms 14656 KB Output is correct
15 Correct 10 ms 14668 KB Output is correct
16 Correct 12 ms 14828 KB Output is correct
17 Correct 11 ms 14668 KB Output is correct
18 Correct 9 ms 14472 KB Output is correct
19 Correct 11 ms 14540 KB Output is correct
20 Correct 10 ms 14668 KB Output is correct
21 Correct 263 ms 32812 KB Output is correct
22 Correct 106 ms 23920 KB Output is correct
23 Correct 315 ms 29212 KB Output is correct
24 Correct 158 ms 26684 KB Output is correct
25 Correct 1093 ms 79524 KB Output is correct
26 Correct 878 ms 68088 KB Output is correct
27 Correct 491 ms 48180 KB Output is correct
28 Correct 572 ms 46920 KB Output is correct
29 Correct 583 ms 46724 KB Output is correct
30 Correct 431 ms 45428 KB Output is correct
31 Correct 208 ms 30716 KB Output is correct
32 Correct 259 ms 24668 KB Output is correct
33 Correct 263 ms 26320 KB Output is correct
34 Correct 559 ms 46228 KB Output is correct
35 Correct 426 ms 38324 KB Output is correct
36 Correct 398 ms 43548 KB Output is correct
37 Correct 471 ms 45524 KB Output is correct
38 Correct 477 ms 52104 KB Output is correct
39 Correct 310 ms 27140 KB Output is correct
40 Correct 638 ms 46696 KB Output is correct
41 Correct 647 ms 46916 KB Output is correct
42 Correct 693 ms 55864 KB Output is correct
43 Correct 312 ms 34308 KB Output is correct
44 Correct 627 ms 37752 KB Output is correct
45 Correct 466 ms 43588 KB Output is correct
46 Correct 431 ms 44080 KB Output is correct
47 Correct 446 ms 44804 KB Output is correct
48 Correct 1121 ms 79892 KB Output is correct