oj.uz

Submission #910120

# Submission time Handle Problem Language Result Execution time Memory
910120 2024-01-17T23:21:30 Z vjudge1 Robot (JOI21_ho_t4) C++17
100 / 100
 1018 ms 84672 KB 
#include <bits/stdc++.h> 
using namespace std; 
typedef long long ll; 
struct Edge {
    int to;
    int c;
    ll p;
};
const int N = 1e5 + 7;
const ll INF = 1e18;
     
int n, m;
map<int, vector<Edge>> g[N];
ll dp[N];
map<int, ll> dp2[N], psum[N];
     
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b, c, p;
        cin >> a >> b >> c >> p;
        g[a][c].push_back({b, c, p});
        g[b][c].push_back({a, c, p});
        psum[a][c] += p;
        psum[b][c] += p;
    }
    for (int i = 1; i <= n; ++i) {
        dp[i] = INF;
    }
    priority_queue<tuple<ll, int, int>> pq;
    dp[1] = 0;
    pq.push({0, 1, 0});
    while (!pq.empty()) {
        ll cost;
        int u, c;
        tie(cost, u, c) = pq.top();
        pq.pop();
        if (c) {
            if (dp2[u][c] != -cost) {
                continue;
            }
            for (auto v : g[u][c]) {
                ll relax = psum[u][c] - v.p;
                if (relax - cost < dp[v.to]) {
                    dp[v.to] = relax - cost;
                    pq.push({-dp[v.to], v.to, 0});
                }
            }
        } 
        else {
            if (dp[u] != -cost) {
                continue;
            }
            for (auto v : g[u]) {
                for (auto edg : v.second) {
                    ll relax = psum[u][edg.c] - edg.p - cost;
                    if (relax < dp[edg.to]) {
                        dp[edg.to] = relax;
                        pq.push({-dp[edg.to], edg.to, 0});
                    }
                    relax = edg.p - cost;
                    if (relax < dp[edg.to]) {
                        dp[edg.to] = relax;
                        pq.push({-dp[edg.to], edg.to, 0});
                    }
                    relax = -cost;
                    if (!dp2[edg.to].count(edg.c) || relax < dp2[edg.to][edg.c]) {
                        dp2[edg.to][edg.c] = relax;
                        pq.push({-dp2[edg.to][edg.c], edg.to, edg.c});
                    }
                }
            }
        }
    }
    if (dp[n] == INF) {
        dp[n] = -1;
    }
    cout << dp[n];
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 4 ms 15196 KB Output is correct
4 Correct 5 ms 15196 KB Output is correct
5 Correct 4 ms 15448 KB Output is correct
6 Correct 4 ms 15192 KB Output is correct
7 Correct 5 ms 15452 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 7 ms 15804 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15556 KB Output is correct
12 Correct 5 ms 15452 KB Output is correct
13 Correct 7 ms 15728 KB Output is correct
14 Correct 6 ms 15728 KB Output is correct
15 Correct 5 ms 15452 KB Output is correct
16 Correct 5 ms 15452 KB Output is correct
17 Correct 5 ms 15704 KB Output is correct
18 Correct 4 ms 15344 KB Output is correct
19 Correct 6 ms 15452 KB Output is correct
20 Correct 5 ms 15452 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 35160 KB Output is correct
2 Correct 53 ms 25292 KB Output is correct
3 Correct 127 ms 32348 KB Output is correct
4 Correct 114 ms 28304 KB Output is correct
5 Correct 1018 ms 82876 KB Output is correct
6 Correct 751 ms 72940 KB Output is correct
7 Correct 348 ms 58752 KB Output is correct
8 Correct 393 ms 51028 KB Output is correct
9 Correct 430 ms 51348 KB Output is correct
10 Correct 378 ms 48168 KB Output is correct
11 Correct 123 ms 32848 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 4 ms 15196 KB Output is correct
4 Correct 5 ms 15196 KB Output is correct
5 Correct 4 ms 15448 KB Output is correct
6 Correct 4 ms 15192 KB Output is correct
7 Correct 5 ms 15452 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 7 ms 15804 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15556 KB Output is correct
12 Correct 5 ms 15452 KB Output is correct
13 Correct 7 ms 15728 KB Output is correct
14 Correct 6 ms 15728 KB Output is correct
15 Correct 5 ms 15452 KB Output is correct
16 Correct 5 ms 15452 KB Output is correct
17 Correct 5 ms 15704 KB Output is correct
18 Correct 4 ms 15344 KB Output is correct
19 Correct 6 ms 15452 KB Output is correct
20 Correct 5 ms 15452 KB Output is correct
21 Correct 196 ms 35160 KB Output is correct
22 Correct 53 ms 25292 KB Output is correct
23 Correct 127 ms 32348 KB Output is correct
24 Correct 114 ms 28304 KB Output is correct
25 Correct 1018 ms 82876 KB Output is correct
26 Correct 751 ms 72940 KB Output is correct
27 Correct 348 ms 58752 KB Output is correct
28 Correct 393 ms 51028 KB Output is correct
29 Correct 430 ms 51348 KB Output is correct
30 Correct 378 ms 48168 KB Output is correct
31 Correct 123 ms 32848 KB Output is correct
32 Correct 83 ms 29140 KB Output is correct
33 Correct 93 ms 30068 KB Output is correct
34 Correct 389 ms 50556 KB Output is correct
35 Correct 247 ms 41968 KB Output is correct
36 Correct 327 ms 47320 KB Output is correct
37 Correct 348 ms 51132 KB Output is correct
38 Correct 323 ms 58028 KB Output is correct
39 Correct 101 ms 32556 KB Output is correct
40 Correct 384 ms 52328 KB Output is correct
41 Correct 443 ms 52564 KB Output is correct
42 Correct 499 ms 60816 KB Output is correct
43 Correct 183 ms 37464 KB Output is correct
44 Correct 279 ms 43716 KB Output is correct
45 Correct 305 ms 47700 KB Output is correct
46 Correct 248 ms 47996 KB Output is correct
47 Correct 333 ms 50456 KB Output is correct
48 Correct 986 ms 84672 KB Output is correct