oj.uz

Submission #844993

# Submission time Handle Problem Language Result Execution time Memory
844993 2023-09-06T10:30:30 Z gtm7 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 197 ms 20404 KB 
#include <bits/stdc++.h>
using namespace std;

const long long mx = 100000000000000000;
void dijkstra(int ss, vector<pair<int, int>> adj[], vector<int> &arr, vector<long long> &d)
{
    using T = pair<long long, int>;
    priority_queue<T, vector<T>, greater<T>> q;
    q.push({0, ss});
    d[ss] = 0;
    long long s, cd;
    while (!q.empty())
    {
        s = q.top().second;
        cd = q.top().first;
        q.pop();
        if (cd > d[s])
            continue;
        arr.push_back(s);
        for (auto x : adj[s])
        {
            if (d[x.first] > d[s] + x.second)
            {
                d[x.first] = d[s] + x.second;
                q.push({d[x.first], x.first});
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, ss, tt, u, v;
    cin >> n >> m >> ss >> tt >> u >> v;
    ss--, tt--, u--, v--;
    int a, b, c;
    vector<pair<int, int>> adj[n];
    for (int i = 0; i < m; i++)
    {
        cin >> a >> b >> c;
        adj[a - 1].push_back({b - 1, c});
        adj[b - 1].push_back({a - 1, c});
    }
    long long vd, ud;
    vector<long long> du(n, mx);
    vector<long long> dv(n, mx);
    vector<long long> dsum(n);
    vector<long long> d(n, mx);
    vector<int> brr;
    vector<int> arr;
    dijkstra(u, adj, brr, du);
    dijkstra(v, adj, brr, dv);
    dijkstra(ss, adj, arr, d);
    for (int i = 0; i < n; i++)
    {
        dsum[i] = du[i] + dv[i];
    }
    long long ans = dsum[v];
    for (auto i : arr)
    {
        vd = dv[i];
        ud = du[i];
        for (auto x : adj[i])
        {
            if (d[i] == d[x.first] + x.second)
            {
                du[i] = min(du[i], du[x.first]);
                dv[i] = min(dv[i], dv[x.first]);
            }
        }
        dsum[i] = min(du[i] + vd, dv[i] + ud);
        for (auto x : adj[i])
        {
            if (d[i] == d[x.first] + x.second)
            {
                dsum[i] = min(dsum[i], dsum[x.first]);
            }
        }
    }
    ans = min(ans, dsum[tt]);
    cout << ans << "\n";
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 19628 KB Output is correct
2 Correct 170 ms 18712 KB Output is correct
3 Correct 156 ms 18084 KB Output is correct
4 Correct 139 ms 18732 KB Output is correct
5 Correct 143 ms 18376 KB Output is correct
6 Correct 152 ms 19700 KB Output is correct
7 Correct 149 ms 18268 KB Output is correct
8 Correct 153 ms 18144 KB Output is correct
9 Correct 178 ms 19076 KB Output is correct
10 Correct 144 ms 19040 KB Output is correct
11 Correct 52 ms 12484 KB Output is correct
12 Correct 163 ms 18848 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 18384 KB Output is correct
2 Correct 174 ms 18252 KB Output is correct
3 Correct 178 ms 18296 KB Output is correct
4 Correct 160 ms 18524 KB Output is correct
5 Correct 165 ms 18276 KB Output is correct
6 Correct 156 ms 18176 KB Output is correct
7 Correct 175 ms 18336 KB Output is correct
8 Correct 188 ms 18424 KB Output is correct
9 Correct 162 ms 18272 KB Output is correct
10 Correct 168 ms 18460 KB Output is correct
11 Correct 55 ms 12592 KB Output is correct
12 Correct 149 ms 18180 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1568 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 2400 KB Output is correct
5 Correct 6 ms 1368 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 536 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 19628 KB Output is correct
2 Correct 170 ms 18712 KB Output is correct
3 Correct 156 ms 18084 KB Output is correct
4 Correct 139 ms 18732 KB Output is correct
5 Correct 143 ms 18376 KB Output is correct
6 Correct 152 ms 19700 KB Output is correct
7 Correct 149 ms 18268 KB Output is correct
8 Correct 153 ms 18144 KB Output is correct
9 Correct 178 ms 19076 KB Output is correct
10 Correct 144 ms 19040 KB Output is correct
11 Correct 52 ms 12484 KB Output is correct
12 Correct 163 ms 18848 KB Output is correct
13 Correct 156 ms 18384 KB Output is correct
14 Correct 174 ms 18252 KB Output is correct
15 Correct 178 ms 18296 KB Output is correct
16 Correct 160 ms 18524 KB Output is correct
17 Correct 165 ms 18276 KB Output is correct
18 Correct 156 ms 18176 KB Output is correct
19 Correct 175 ms 18336 KB Output is correct
20 Correct 188 ms 18424 KB Output is correct
21 Correct 162 ms 18272 KB Output is correct
22 Correct 168 ms 18460 KB Output is correct
23 Correct 55 ms 12592 KB Output is correct
24 Correct 149 ms 18180 KB Output is correct
25 Correct 6 ms 1568 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 10 ms 2400 KB Output is correct
29 Correct 6 ms 1368 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 536 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 5 ms 1372 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 177 ms 20404 KB Output is correct
41 Correct 197 ms 19456 KB Output is correct
42 Correct 162 ms 19320 KB Output is correct
43 Correct 57 ms 12644 KB Output is correct
44 Correct 52 ms 12808 KB Output is correct
45 Correct 159 ms 18152 KB Output is correct
46 Correct 156 ms 18128 KB Output is correct
47 Correct 167 ms 20040 KB Output is correct
48 Correct 74 ms 12288 KB Output is correct
49 Correct 146 ms 20208 KB Output is correct
50 Correct 163 ms 18840 KB Output is correct
51 Correct 146 ms 18180 KB Output is correct