oj.uz

Submission #623608

# Submission time Handle Problem Language Result Execution time Memory
623608 2022-08-06T05:20:24 Z BhavayGoyal Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 438 ms 31860 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e16;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 1e5;
int n, m, s, t, u, v; 
vector<array<int, 2>> g[N];
vi du(N, inf), dv(N, inf), dpu(N, inf), dpv(N, inf), dis(N, inf);
int ans = inf;

void dijkstra(int src, vi &distance) {
    distance[src] = 0;
    priority_queue<pii, vector<pii>, greater<pii>> q;
    q.push({0, src});
    while (!q.empty()) {
        int dist = q.top().f, src = q.top().s; q.pop();
        for (auto ch : g[src]) {
            if (ch[1]+dist < distance[ch[0]]) {
                distance[ch[0]] = ch[1]+dist;
                q.push({distance[ch[0]], ch[0]});
            }
        }
    }
}

void dijkstra2(int src, int end) {
    dpu = vi(n, inf); dpv = vi(n, inf);
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> q;
    q.push({0, src, src});
    vi vis(n, 0);
    while (!q.empty()) {
        int dist = q.top()[0], src = q.top()[1], par = q.top()[2]; q.pop();
        if (!vis[src]) {
            vis[src] = true;
            dis[src] = dist;
            dpu[src] = min(dpu[par], du[src]);
            dpv[src] = min(dpv[par], dv[src]);
            for (auto ch : g[src]) q.push({dist+ch[1], ch[0], src});
        }
        else if (dis[src] == dist) {
            if (min(dpu[par], du[src]) + min(dpv[par], dv[src]) <= dpu[src]+dpv[src]) {
                dpu[src] = min(dpu[par], du[src]);
                dpv[src] = min(dpv[par], dv[src]);
            }
        }
    }
    ans = min(ans, dpu[end]+dpv[end]);
}

void sol() {
    cin >> n >> m >> s >> t >> u >> v; --s; --t; --u; --v;
    for (int i = 0; i < m; i++) {
        int a, b, c; cin >> a >> b >> c;
        g[--a].pb({--b, c});
        g[b].pb({a, c});
    }

    dijkstra(u, du);
    dijkstra(v, dv);

    ans = du[v];

    dijkstra2(s, t);
    dijkstra2(t, s);

    cout << ans << endl;
}

signed main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 27852 KB Output is correct
2 Correct 399 ms 30856 KB Output is correct
3 Correct 390 ms 30588 KB Output is correct
4 Correct 416 ms 30828 KB Output is correct
5 Correct 376 ms 27184 KB Output is correct
6 Correct 425 ms 31708 KB Output is correct
7 Correct 380 ms 30820 KB Output is correct
8 Correct 382 ms 30892 KB Output is correct
9 Correct 409 ms 31860 KB Output is correct
10 Correct 371 ms 31492 KB Output is correct
11 Correct 123 ms 14644 KB Output is correct
12 Correct 438 ms 31784 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 27696 KB Output is correct
2 Correct 395 ms 27248 KB Output is correct
3 Correct 395 ms 30436 KB Output is correct
4 Correct 412 ms 27388 KB Output is correct
5 Correct 393 ms 27268 KB Output is correct
6 Correct 389 ms 30692 KB Output is correct
7 Correct 389 ms 27080 KB Output is correct
8 Correct 405 ms 27208 KB Output is correct
9 Correct 404 ms 27060 KB Output is correct
10 Correct 408 ms 30520 KB Output is correct
11 Correct 123 ms 14692 KB Output is correct
12 Correct 380 ms 30764 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 7892 KB Output is correct
2 Correct 4 ms 6612 KB Output is correct
3 Correct 4 ms 6612 KB Output is correct
4 Correct 47 ms 10840 KB Output is correct
5 Correct 26 ms 9148 KB Output is correct
6 Correct 5 ms 6612 KB Output is correct
7 Correct 6 ms 6760 KB Output is correct
8 Correct 6 ms 6748 KB Output is correct
9 Correct 5 ms 6612 KB Output is correct
10 Correct 26 ms 8960 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 4 ms 6612 KB Output is correct
14 Correct 5 ms 6612 KB Output is correct
15 Correct 4 ms 6620 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 27852 KB Output is correct
2 Correct 399 ms 30856 KB Output is correct
3 Correct 390 ms 30588 KB Output is correct
4 Correct 416 ms 30828 KB Output is correct
5 Correct 376 ms 27184 KB Output is correct
6 Correct 425 ms 31708 KB Output is correct
7 Correct 380 ms 30820 KB Output is correct
8 Correct 382 ms 30892 KB Output is correct
9 Correct 409 ms 31860 KB Output is correct
10 Correct 371 ms 31492 KB Output is correct
11 Correct 123 ms 14644 KB Output is correct
12 Correct 438 ms 31784 KB Output is correct
13 Correct 414 ms 27696 KB Output is correct
14 Correct 395 ms 27248 KB Output is correct
15 Correct 395 ms 30436 KB Output is correct
16 Correct 412 ms 27388 KB Output is correct
17 Correct 393 ms 27268 KB Output is correct
18 Correct 389 ms 30692 KB Output is correct
19 Correct 389 ms 27080 KB Output is correct
20 Correct 405 ms 27208 KB Output is correct
21 Correct 404 ms 27060 KB Output is correct
22 Correct 408 ms 30520 KB Output is correct
23 Correct 123 ms 14692 KB Output is correct
24 Correct 380 ms 30764 KB Output is correct
25 Correct 27 ms 7892 KB Output is correct
26 Correct 4 ms 6612 KB Output is correct
27 Correct 4 ms 6612 KB Output is correct
28 Correct 47 ms 10840 KB Output is correct
29 Correct 26 ms 9148 KB Output is correct
30 Correct 5 ms 6612 KB Output is correct
31 Correct 6 ms 6760 KB Output is correct
32 Correct 6 ms 6748 KB Output is correct
33 Correct 5 ms 6612 KB Output is correct
34 Correct 26 ms 8960 KB Output is correct
35 Correct 3 ms 6612 KB Output is correct
36 Correct 3 ms 6612 KB Output is correct
37 Correct 4 ms 6612 KB Output is correct
38 Correct 5 ms 6612 KB Output is correct
39 Correct 4 ms 6620 KB Output is correct
40 Correct 413 ms 31356 KB Output is correct
41 Correct 403 ms 31616 KB Output is correct
42 Correct 407 ms 31668 KB Output is correct
43 Correct 120 ms 14748 KB Output is correct
44 Correct 117 ms 14736 KB Output is correct
45 Correct 365 ms 25860 KB Output is correct
46 Correct 375 ms 25512 KB Output is correct
47 Correct 409 ms 27448 KB Output is correct
48 Correct 126 ms 14156 KB Output is correct
49 Correct 378 ms 29996 KB Output is correct
50 Correct 371 ms 25828 KB Output is correct
51 Correct 352 ms 25820 KB Output is correct