oj.uz

Submission #415842

# Submission time Handle Problem Language Result Execution time Memory
415842 2021-06-01T15:35:47 Z ruadhan Robot (JOI21_ho_t4) C++17
100 / 100
 1405 ms 84392 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll INF = 1e18;

struct Edge
{
    int to, c;
    ll p;
};

map<int, vector<Edge>> graph[100001];
ll dp[100001];
map<int, ll> dp2[100001], psum[100001];

int main()
{
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < M; i++)
    {
        int u, v, c;
        ll p;
        cin >> u >> v >> c >> p;
        graph[u][c].push_back({v, c, p});
        graph[v][c].push_back({u, c, p});
        psum[u][c] += p;
        psum[v][c] += p;
    }

    for (int i = 0; i <= N; i++)
        dp[i] = LONG_LONG_MAX;

    dp[1] = 0;
    using T = tuple<ll, int, int>;
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.push({0, 1, 0});

    while (!pq.empty())
    {
        ll cost;
        int node, c;
        tie(cost, node, c) = pq.top();
        pq.pop();
        if (c)
        {
            if (dp2[node][c] != cost)
                continue;
            for (Edge i : graph[node][c])
            {
                ll case1 = psum[node][c] - i.p + cost;
                if (case1 < dp[i.to])
                {
                    dp[i.to] = case1;
                    pq.push({dp[i.to], i.to, 0});
                }
            }
        }
        else
        {
            if (dp[node] != cost)
                continue;
            for (auto &i : graph[node])
            {
                for (Edge j : i.second)
                {
                    ll case1 = psum[node][j.c] - j.p + cost;
                    if (case1 < dp[j.to])
                    {
                        dp[j.to] = case1;
                        pq.push({dp[j.to], j.to, 0});
                    }

                    ll case2 = j.p + cost;
                    if (case2 < dp[j.to])
                    {
                        dp[j.to] = case2;
                        pq.push({dp[j.to], j.to, 0});
                    }

                    ll case3 = cost;
                    if (!dp2[j.to].count(j.c) || case3 < dp2[j.to][j.c])
                    {
                        dp2[j.to][j.c] = case3;
                        pq.push({dp2[j.to][j.c], j.to, j.c});
                    }
                }
            }
        }
    }

    cout << (dp[N] == LONG_LONG_MAX ? -1 : dp[N]) << '\n';

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14284 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 11 ms 14540 KB Output is correct
8 Correct 10 ms 14400 KB Output is correct
9 Correct 14 ms 15052 KB Output is correct
10 Correct 14 ms 14924 KB Output is correct
11 Correct 12 ms 14728 KB Output is correct
12 Correct 13 ms 14668 KB Output is correct
13 Correct 13 ms 14652 KB Output is correct
14 Correct 12 ms 14664 KB Output is correct
15 Correct 13 ms 14668 KB Output is correct
16 Correct 14 ms 14660 KB Output is correct
17 Correct 13 ms 14792 KB Output is correct
18 Correct 12 ms 14540 KB Output is correct
19 Correct 14 ms 14668 KB Output is correct
20 Correct 13 ms 14724 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 34444 KB Output is correct
2 Correct 138 ms 24544 KB Output is correct
3 Correct 376 ms 31456 KB Output is correct
4 Correct 161 ms 27704 KB Output is correct
5 Correct 1373 ms 82608 KB Output is correct
6 Correct 1066 ms 72060 KB Output is correct
7 Correct 617 ms 56268 KB Output is correct
8 Correct 612 ms 50780 KB Output is correct
9 Correct 746 ms 50896 KB Output is correct
10 Correct 442 ms 47840 KB Output is correct
11 Correct 228 ms 32816 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14284 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 11 ms 14540 KB Output is correct
8 Correct 10 ms 14400 KB Output is correct
9 Correct 14 ms 15052 KB Output is correct
10 Correct 14 ms 14924 KB Output is correct
11 Correct 12 ms 14728 KB Output is correct
12 Correct 13 ms 14668 KB Output is correct
13 Correct 13 ms 14652 KB Output is correct
14 Correct 12 ms 14664 KB Output is correct
15 Correct 13 ms 14668 KB Output is correct
16 Correct 14 ms 14660 KB Output is correct
17 Correct 13 ms 14792 KB Output is correct
18 Correct 12 ms 14540 KB Output is correct
19 Correct 14 ms 14668 KB Output is correct
20 Correct 13 ms 14724 KB Output is correct
21 Correct 334 ms 34444 KB Output is correct
22 Correct 138 ms 24544 KB Output is correct
23 Correct 376 ms 31456 KB Output is correct
24 Correct 161 ms 27704 KB Output is correct
25 Correct 1373 ms 82608 KB Output is correct
26 Correct 1066 ms 72060 KB Output is correct
27 Correct 617 ms 56268 KB Output is correct
28 Correct 612 ms 50780 KB Output is correct
29 Correct 746 ms 50896 KB Output is correct
30 Correct 442 ms 47840 KB Output is correct
31 Correct 228 ms 32816 KB Output is correct
32 Correct 280 ms 28284 KB Output is correct
33 Correct 292 ms 29240 KB Output is correct
34 Correct 647 ms 50228 KB Output is correct
35 Correct 503 ms 41388 KB Output is correct
36 Correct 475 ms 47276 KB Output is correct
37 Correct 590 ms 49116 KB Output is correct
38 Correct 596 ms 55548 KB Output is correct
39 Correct 408 ms 31748 KB Output is correct
40 Correct 762 ms 52160 KB Output is correct
41 Correct 788 ms 52468 KB Output is correct
42 Correct 781 ms 60708 KB Output is correct
43 Correct 417 ms 36844 KB Output is correct
44 Correct 883 ms 42580 KB Output is correct
45 Correct 614 ms 47548 KB Output is correct
46 Correct 464 ms 47844 KB Output is correct
47 Correct 568 ms 49028 KB Output is correct
48 Correct 1405 ms 84392 KB Output is correct