oj.uz

Submission #623610

# Submission time Handle Problem Language Result Execution time Memory
623610 2022-08-06T05:23:37 Z BhavayGoyal Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 313 ms 27232 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);

    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 291 ms 26916 KB Output is correct
2 Correct 282 ms 25576 KB Output is correct
3 Correct 273 ms 22392 KB Output is correct
4 Correct 308 ms 27232 KB Output is correct
5 Correct 278 ms 22468 KB Output is correct
6 Correct 294 ms 27060 KB Output is correct
7 Correct 281 ms 25560 KB Output is correct
8 Correct 279 ms 25492 KB Output is correct
9 Correct 295 ms 25628 KB Output is correct
10 Correct 264 ms 25740 KB Output is correct
11 Correct 90 ms 12732 KB Output is correct
12 Correct 313 ms 25752 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 25540 KB Output is correct
2 Correct 289 ms 22516 KB Output is correct
3 Correct 297 ms 22500 KB Output is correct
4 Correct 285 ms 22508 KB Output is correct
5 Correct 298 ms 22516 KB Output is correct
6 Correct 298 ms 22380 KB Output is correct
7 Correct 290 ms 22388 KB Output is correct
8 Correct 285 ms 22532 KB Output is correct
9 Correct 302 ms 22520 KB Output is correct
10 Correct 300 ms 22516 KB Output is correct
11 Correct 94 ms 12736 KB Output is correct
12 Correct 283 ms 22484 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7924 KB Output is correct
2 Correct 4 ms 6616 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 33 ms 10180 KB Output is correct
5 Correct 17 ms 8752 KB Output is correct
6 Correct 4 ms 6612 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 6 ms 6752 KB Output is correct
9 Correct 5 ms 6756 KB Output is correct
10 Correct 16 ms 8020 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 6620 KB Output is correct
14 Correct 4 ms 6612 KB Output is correct
15 Correct 4 ms 6624 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 26916 KB Output is correct
2 Correct 282 ms 25576 KB Output is correct
3 Correct 273 ms 22392 KB Output is correct
4 Correct 308 ms 27232 KB Output is correct
5 Correct 278 ms 22468 KB Output is correct
6 Correct 294 ms 27060 KB Output is correct
7 Correct 281 ms 25560 KB Output is correct
8 Correct 279 ms 25492 KB Output is correct
9 Correct 295 ms 25628 KB Output is correct
10 Correct 264 ms 25740 KB Output is correct
11 Correct 90 ms 12732 KB Output is correct
12 Correct 313 ms 25752 KB Output is correct
13 Correct 294 ms 25540 KB Output is correct
14 Correct 289 ms 22516 KB Output is correct
15 Correct 297 ms 22500 KB Output is correct
16 Correct 285 ms 22508 KB Output is correct
17 Correct 298 ms 22516 KB Output is correct
18 Correct 298 ms 22380 KB Output is correct
19 Correct 290 ms 22388 KB Output is correct
20 Correct 285 ms 22532 KB Output is correct
21 Correct 302 ms 22520 KB Output is correct
22 Correct 300 ms 22516 KB Output is correct
23 Correct 94 ms 12736 KB Output is correct
24 Correct 283 ms 22484 KB Output is correct
25 Correct 16 ms 7924 KB Output is correct
26 Correct 4 ms 6616 KB Output is correct
27 Correct 3 ms 6612 KB Output is correct
28 Correct 33 ms 10180 KB Output is correct
29 Correct 17 ms 8752 KB Output is correct
30 Correct 4 ms 6612 KB Output is correct
31 Correct 5 ms 6740 KB Output is correct
32 Correct 6 ms 6752 KB Output is correct
33 Correct 5 ms 6756 KB Output is correct
34 Correct 16 ms 8020 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 6620 KB Output is correct
38 Correct 4 ms 6612 KB Output is correct
39 Correct 4 ms 6624 KB Output is correct
40 Correct 276 ms 26296 KB Output is correct
41 Correct 296 ms 25564 KB Output is correct
42 Correct 289 ms 25724 KB Output is correct
43 Correct 100 ms 12708 KB Output is correct
44 Correct 92 ms 12748 KB Output is correct
45 Correct 264 ms 22464 KB Output is correct
46 Correct 266 ms 22400 KB Output is correct
47 Correct 293 ms 23592 KB Output is correct
48 Correct 97 ms 12768 KB Output is correct
49 Correct 252 ms 26184 KB Output is correct
50 Correct 267 ms 22504 KB Output is correct
51 Correct 253 ms 22408 KB Output is correct