oj.uz

Submission #976247

# Submission time Handle Problem Language Result Execution time Memory
976247 2024-05-06T10:47:57 Z UltraFalcon Robot (JOI21_ho_t4) C++17
100 / 100
 522 ms 63904 KB 
#ifndef DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,abm,mmx,fma,popcnt")
#endif

#include <bits/stdc++.h>
#define int long long
using ll = long long;

using namespace std;

const int INF = 1e18;

int n, m;
vector<vector<array<int, 3>>> adj;
vector<map<int, int>> cost_sum;

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

    cin >> n >> m;

    adj.assign(n, {});
    cost_sum.assign(n, {});
    for (int i=0; i<m; i++) {
        int a, b, c, p;
        cin >> a >> b >> c >> p;
        a--; b--;
        adj[a].push_back({b, c, p});
        adj[b].push_back({a, c, p});
        cost_sum[a][c] += p;
        cost_sum[b][c] += p;
    }

    priority_queue<pair<int, int>,
                   vector<pair<int, int>>,
                   greater<pair<int, int>>> pq;
    vector<int> dist(n, INF);
    vector<map<int, int>> min_cost_col(n);

    pq.push({0, 0});
    while (!pq.empty()) {
        auto [d, v] = pq.top(); pq.pop();
        if (dist[v] < INF) continue;
        dist[v] = d;
        for (auto [u, c, p] : adj[v]) { 
            if (dist[u] < INF) continue;
            if (cost_sum[v][c] == p) {
                // only one edge of color c
                pq.push({d, u});
            } else {
                pq.push({d+p, u});
                if (min_cost_col[u].count(c) == 0) min_cost_col[u][c] = INF;
                min_cost_col[u][c] = min(min_cost_col[u][c], d);
                pq.push({d + cost_sum[v][c]-p, u});
                // Case 2
                if (min_cost_col[v].count(c) == 0) min_cost_col[v][c] = INF;
                pq.push({min_cost_col[v][c]+cost_sum[v][c]-p, u});
            }
        }
    }

    if (dist[n-1] >= INF) {
        cout << -1 << "\n";
        return 0;
    }
    cout << dist[n-1] << "\n";


}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 380 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1012 KB Output is correct
10 Correct 3 ms 976 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 2 ms 604 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 21956 KB Output is correct
2 Correct 42 ms 10408 KB Output is correct
3 Correct 153 ms 26700 KB Output is correct
4 Correct 72 ms 14892 KB Output is correct
5 Correct 522 ms 62836 KB Output is correct
6 Correct 450 ms 61064 KB Output is correct
7 Correct 270 ms 60060 KB Output is correct
8 Correct 312 ms 43332 KB Output is correct
9 Correct 299 ms 43216 KB Output is correct
10 Correct 173 ms 34180 KB Output is correct
11 Correct 87 ms 24036 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 380 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1012 KB Output is correct
10 Correct 3 ms 976 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 128 ms 21956 KB Output is correct
22 Correct 42 ms 10408 KB Output is correct
23 Correct 153 ms 26700 KB Output is correct
24 Correct 72 ms 14892 KB Output is correct
25 Correct 522 ms 62836 KB Output is correct
26 Correct 450 ms 61064 KB Output is correct
27 Correct 270 ms 60060 KB Output is correct
28 Correct 312 ms 43332 KB Output is correct
29 Correct 299 ms 43216 KB Output is correct
30 Correct 173 ms 34180 KB Output is correct
31 Correct 87 ms 24036 KB Output is correct
32 Correct 156 ms 25068 KB Output is correct
33 Correct 129 ms 24984 KB Output is correct
34 Correct 240 ms 39976 KB Output is correct
35 Correct 215 ms 30344 KB Output is correct
36 Correct 221 ms 40136 KB Output is correct
37 Correct 239 ms 46460 KB Output is correct
38 Correct 290 ms 59428 KB Output is correct
39 Correct 158 ms 30284 KB Output is correct
40 Correct 267 ms 44628 KB Output is correct
41 Correct 278 ms 44704 KB Output is correct
42 Correct 339 ms 54908 KB Output is correct
43 Correct 124 ms 25656 KB Output is correct
44 Correct 251 ms 38404 KB Output is correct
45 Correct 217 ms 39736 KB Output is correct
46 Correct 218 ms 38632 KB Output is correct
47 Correct 228 ms 46240 KB Output is correct
48 Correct 491 ms 63904 KB Output is correct