oj.uz

Submission #568271

# Submission time Handle Problem Language Result Execution time Memory
568271 2022-05-25T04:44:57 Z aadit_ambadkar Robot (JOI21_ho_t4) C++11
100 / 100
 1795 ms 113100 KB 
#include <bits/stdc++.h>

#define ll long long

const int MAXN = 1e5 + 10;
const int MAXM = 2e5 + 10;
const ll inf = 1e18 + 10LL;

using namespace std;

int N, M;
int color[MAXM * 2];
int j[MAXM * 2];
ll p[MAXM * 2];
map<pair<int, int>, ll> cost;
map<pair<int, int>, int> key;
vector<int> adj[MAXN];
vector<pair<int, ll>> graph[MAXM * 3];

void add(pair<int, int> nodeInf, ll val)
{
    if (cost.find(nodeInf) == cost.end())
        cost[nodeInf] = 0;
    cost[nodeInf] += val;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M;

    for (int i = 0, a, b; i < 2 * M; i += 2)
    {

        cin >> a >> b >> color[i] >> p[i];

        j[i] = b;
        j[i + 1] = a;
        color[i + 1] = color[i];
        p[i + 1] = p[i];

        add(make_pair(a, color[i]), p[i]);
        add(make_pair(b, color[i]), p[i]);

        key[make_pair(a, color[i])] = key[make_pair(b, color[i])] = 0;

        adj[a].push_back(i);
        adj[b].push_back(i + 1);
    }

    for (int i = 1; i <= N; i++)
        key[make_pair(i, 0)] = 0;

    int Key = 0;
    for (auto &e : key)
        e.second = ++Key;

    for (int i = 1; i <= N; i++)
    {

        int x = key[make_pair(i, 0)];

        for (auto e : adj[i])
        {

            int y = key[make_pair(i, color[e])];
            int a = key[make_pair(j[e], 0)];
            int b = key[make_pair(j[e], color[e])];

            graph[a].push_back(make_pair(y, cost[make_pair(i, color[e])] - p[e]));
            graph[b].push_back(make_pair(x, 0));
            graph[a].push_back(make_pair(x, p[e]));
        }
    }

    for (auto e : key)
        if (e.first.second)
            graph[e.second].push_back(make_pair(key[make_pair(e.first.first, 0)], 0));

    vector<ll> dist(Key + 1, inf);

    int T = key[make_pair(N, 0)];

    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;

    pq.push(make_pair(dist[T] = 0, T));

    while (!pq.empty())
    {

        int x = pq.top().second;
        ll d = pq.top().first;

        pq.pop();

        if (d != dist[x])
            continue;

        for (auto e : graph[x])
        {

            ll newD = d + e.second;
            int node = e.first;

            if (newD >= dist[node])
                continue;

            pq.push(make_pair(dist[node] = newD, node));
        }
    }

    int S = key[make_pair(1, 0)];

    if (dist[S] == inf)
        dist[S] = -1;

    cout << dist[S] << "\n";
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 9 ms 16724 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 9 ms 16768 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 11 ms 16980 KB Output is correct
8 Correct 9 ms 16924 KB Output is correct
9 Correct 14 ms 17620 KB Output is correct
10 Correct 13 ms 17592 KB Output is correct
11 Correct 13 ms 17484 KB Output is correct
12 Correct 12 ms 17384 KB Output is correct
13 Correct 14 ms 17488 KB Output is correct
14 Correct 12 ms 17364 KB Output is correct
15 Correct 12 ms 17168 KB Output is correct
16 Correct 14 ms 17440 KB Output is correct
17 Correct 14 ms 17364 KB Output is correct
18 Correct 11 ms 17108 KB Output is correct
19 Correct 13 ms 17300 KB Output is correct
20 Correct 13 ms 17340 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 440 ms 46840 KB Output is correct
2 Correct 196 ms 31564 KB Output is correct
3 Correct 544 ms 53392 KB Output is correct
4 Correct 266 ms 37536 KB Output is correct
5 Correct 1600 ms 109248 KB Output is correct
6 Correct 1305 ms 98104 KB Output is correct
7 Correct 734 ms 84660 KB Output is correct
8 Correct 1183 ms 83212 KB Output is correct
9 Correct 1161 ms 83180 KB Output is correct
10 Correct 767 ms 66372 KB Output is correct
11 Correct 525 ms 55328 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 9 ms 16724 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 9 ms 16768 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 11 ms 16980 KB Output is correct
8 Correct 9 ms 16924 KB Output is correct
9 Correct 14 ms 17620 KB Output is correct
10 Correct 13 ms 17592 KB Output is correct
11 Correct 13 ms 17484 KB Output is correct
12 Correct 12 ms 17384 KB Output is correct
13 Correct 14 ms 17488 KB Output is correct
14 Correct 12 ms 17364 KB Output is correct
15 Correct 12 ms 17168 KB Output is correct
16 Correct 14 ms 17440 KB Output is correct
17 Correct 14 ms 17364 KB Output is correct
18 Correct 11 ms 17108 KB Output is correct
19 Correct 13 ms 17300 KB Output is correct
20 Correct 13 ms 17340 KB Output is correct
21 Correct 440 ms 46840 KB Output is correct
22 Correct 196 ms 31564 KB Output is correct
23 Correct 544 ms 53392 KB Output is correct
24 Correct 266 ms 37536 KB Output is correct
25 Correct 1600 ms 109248 KB Output is correct
26 Correct 1305 ms 98104 KB Output is correct
27 Correct 734 ms 84660 KB Output is correct
28 Correct 1183 ms 83212 KB Output is correct
29 Correct 1161 ms 83180 KB Output is correct
30 Correct 767 ms 66372 KB Output is correct
31 Correct 525 ms 55328 KB Output is correct
32 Correct 369 ms 50304 KB Output is correct
33 Correct 403 ms 48348 KB Output is correct
34 Correct 934 ms 71944 KB Output is correct
35 Correct 668 ms 59244 KB Output is correct
36 Correct 753 ms 70832 KB Output is correct
37 Correct 796 ms 76728 KB Output is correct
38 Correct 736 ms 86528 KB Output is correct
39 Correct 442 ms 59756 KB Output is correct
40 Correct 1182 ms 84432 KB Output is correct
41 Correct 1215 ms 84680 KB Output is correct
42 Correct 1218 ms 88368 KB Output is correct
43 Correct 527 ms 52672 KB Output is correct
44 Correct 1002 ms 75556 KB Output is correct
45 Correct 961 ms 72868 KB Output is correct
46 Correct 828 ms 69156 KB Output is correct
47 Correct 750 ms 74620 KB Output is correct
48 Correct 1795 ms 113100 KB Output is correct