oj.uz

Submission #784575

# Submission time Handle Problem Language Result Execution time Memory
784575 2023-07-16T10:00:32 Z borisAngelov Robot (JOI21_ho_t4) C++17
100 / 100
 811 ms 84376 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;
const long long inf = 1e18;

int n, m;

struct edge
{
    int to;
    int col;
    long long price;
};

map<int, vector<edge>> g[maxn];

long long dist[maxn];

map<int, long long> dp[maxn];
map<int, long long> sum[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m;

    for (int i = 1; i <= m; ++i)
    {
        int x, y, col, p;
        cin >> x >> y >> col >> p;

        g[x][col].push_back({y, col, p});
        g[y][col].push_back({x, col, p});

        sum[x][col] += p;
        sum[y][col] += p;
    }

    for (int i = 1; i <= n; ++i)
    {
        dist[i] = inf;
    }

    priority_queue<pair<long long, pair<int, int>>> pq;
    pq.push(make_pair(0LL, make_pair(1, 0)));
    dist[1] = 0;

    while (!pq.empty())
    {
        long long curr = -pq.top().first;
        int node = pq.top().second.first;
        int col = pq.top().second.second;

        pq.pop();

        if (col != 0 && dp[node][col] == curr)
        {
            for (auto e : g[node][col])
            {
                long long path = curr + sum[node][col] - e.price;

                if (dist[e.to] > path)
                {
                    dist[e.to] = path;
                    pq.push(make_pair(-path, make_pair(e.to, 0)));
                }
            }
        }
        else if (col == 0 && dist[node] == curr)
        {
            for (auto edges : g[node])
            {
                for (auto e : edges.second)
                {
                    long long path1 = curr + sum[node][e.col] - e.price;

                    if (dist[e.to] > path1)
                    {
                        dist[e.to] = path1;
                        pq.push(make_pair(-path1, make_pair(e.to, 0)));
                    }

                    long long path2 = curr + e.price;

                    if (dist[e.to] > path2)
                    {
                        dist[e.to] = path2;
                        pq.push(make_pair(-path2, make_pair(e.to, 0)));
                    }

                    long long path3 = curr;

                    if (dp[e.to].find(e.col) == dp[e.to].end() || path3 < dp[e.to][e.col])
                    {
                        dp[e.to][e.col] = path3;
                        pq.push(make_pair(-path3, make_pair(e.to, e.col)));
                    }
                }
            }
        }
    }

    if (dist[n] == inf)
    {
        cout << -1 << endl;
    }
    else
    {
        cout << dist[n] << endl;
    }

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14416 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 7 ms 14360 KB Output is correct
7 Correct 7 ms 14560 KB Output is correct
8 Correct 7 ms 14412 KB Output is correct
9 Correct 9 ms 15060 KB Output is correct
10 Correct 9 ms 14984 KB Output is correct
11 Correct 8 ms 14816 KB Output is correct
12 Correct 8 ms 14688 KB Output is correct
13 Correct 10 ms 14716 KB Output is correct
14 Correct 8 ms 14812 KB Output is correct
15 Correct 8 ms 14672 KB Output is correct
16 Correct 10 ms 14688 KB Output is correct
17 Correct 8 ms 14816 KB Output is correct
18 Correct 8 ms 14548 KB Output is correct
19 Correct 10 ms 14672 KB Output is correct
20 Correct 8 ms 14672 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 32960 KB Output is correct
2 Correct 56 ms 24588 KB Output is correct
3 Correct 115 ms 31576 KB Output is correct
4 Correct 78 ms 27756 KB Output is correct
5 Correct 806 ms 82604 KB Output is correct
6 Correct 584 ms 72772 KB Output is correct
7 Correct 279 ms 57888 KB Output is correct
8 Correct 343 ms 50868 KB Output is correct
9 Correct 318 ms 50920 KB Output is correct
10 Correct 259 ms 47840 KB Output is correct
11 Correct 113 ms 32572 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14416 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 7 ms 14360 KB Output is correct
7 Correct 7 ms 14560 KB Output is correct
8 Correct 7 ms 14412 KB Output is correct
9 Correct 9 ms 15060 KB Output is correct
10 Correct 9 ms 14984 KB Output is correct
11 Correct 8 ms 14816 KB Output is correct
12 Correct 8 ms 14688 KB Output is correct
13 Correct 10 ms 14716 KB Output is correct
14 Correct 8 ms 14812 KB Output is correct
15 Correct 8 ms 14672 KB Output is correct
16 Correct 10 ms 14688 KB Output is correct
17 Correct 8 ms 14816 KB Output is correct
18 Correct 8 ms 14548 KB Output is correct
19 Correct 10 ms 14672 KB Output is correct
20 Correct 8 ms 14672 KB Output is correct
21 Correct 139 ms 32960 KB Output is correct
22 Correct 56 ms 24588 KB Output is correct
23 Correct 115 ms 31576 KB Output is correct
24 Correct 78 ms 27756 KB Output is correct
25 Correct 806 ms 82604 KB Output is correct
26 Correct 584 ms 72772 KB Output is correct
27 Correct 279 ms 57888 KB Output is correct
28 Correct 343 ms 50868 KB Output is correct
29 Correct 318 ms 50920 KB Output is correct
30 Correct 259 ms 47840 KB Output is correct
31 Correct 113 ms 32572 KB Output is correct
32 Correct 88 ms 28296 KB Output is correct
33 Correct 101 ms 29256 KB Output is correct
34 Correct 361 ms 50380 KB Output is correct
35 Correct 230 ms 41324 KB Output is correct
36 Correct 268 ms 47280 KB Output is correct
37 Correct 303 ms 50280 KB Output is correct
38 Correct 305 ms 57256 KB Output is correct
39 Correct 94 ms 31872 KB Output is correct
40 Correct 359 ms 52204 KB Output is correct
41 Correct 343 ms 52436 KB Output is correct
42 Correct 422 ms 60736 KB Output is correct
43 Correct 148 ms 36896 KB Output is correct
44 Correct 267 ms 42632 KB Output is correct
45 Correct 270 ms 47548 KB Output is correct
46 Correct 227 ms 47868 KB Output is correct
47 Correct 270 ms 49860 KB Output is correct
48 Correct 811 ms 84376 KB Output is correct