oj.uz

Submission #881340

# Submission time Handle Problem Language Result Execution time Memory
881340 2023-12-01T07:03:55 Z _KuroNeko_ Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 247 ms 30632 KB 
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vdb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef set<int> si;
typedef set<long long> sl;
typedef set<double> sdb;
typedef set<string> ss;
typedef set<char> sc;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ftb(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define ft(i, a, b) for (int i = a, _b = b; i < _b; ++i)
#define fgb(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define fg(i, a, b) for (int i = a, _b = b; i > _b; --i)
#define endl "\n"
void dijkstra(int node, vector<pll> adj[], vl& distance) {
    distance[node] = 0;
    priority_queue<pll, vector<pll>, greater<pll>> q;
    q.push({ 0,node });
    while (!q.empty()) {
        int node = q.top().second;
        ll d = q.top().first;
        q.pop();
        if (d > distance[node]) continue;
        for (pll it : adj[node]) {
            if (distance[it.first] > d + it.second) {
                distance[it.first] = d + it.second;
                q.push({ d + it.second,it.first });
            }
        }
    }
}
void dijkstra2(int node, vector<pll> adj[], vl parent[], int n) {
    vl distance(n + 1, 1e17);
    distance[node] = 0;
    priority_queue<pll, vector<pll>, greater<pll>> q;
    q.push({ 0,node });
    while (!q.empty()) {
        int node = q.top().second;
        ll d = q.top().first;
        q.pop();
        if (d > distance[node]) continue;
        for (pll it : adj[node]) {
            if (distance[it.first] > d + it.second) {
                distance[it.first] = d + it.second;
                q.push({ d + it.second,it.first });
                parent[it.first].clear();
                parent[it.first].push_back(node);
            }
            else if (distance[it.first] == d + it.second) {
                parent[it.first].push_back(node);
            }
        }
    }
}
void bfs(int n, int s, vl adj[], vl& disU, vl& disV, ll& ans) {
    vi cnt(n + 1, 0);
    ftb(i, 1, n) {
        for (int it : adj[i]) {
            cnt[it] += 1;
        }
    }
    queue<int> q;
    vl mn(n + 1, 0);
    ftb(i, 1, n) {
        mn[i] = disU[i];
    }
    q.push(s);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        ans = min(ans, mn[node] + disV[node]);
        for (int it : adj[node]) {
            cnt[it] -= 1;
            mn[it] = min(mn[it], mn[node]);
            if (cnt[it] == 0) {
                q.push(it);
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("C:\\Users\\tring\\Downloads\\2018-ho-data\\2018-ho-data\\2018-ho-t4\\in\\03-01.txt", "r", stdin);
    ll n, m;
    cin >> n >> m;
    ll s, t, u, v;
    cin >> s >> t >> u >> v;
    vector<pll> adj[n + 1];
    ft(i, 0, m) {
        ll x, y, z;
        cin >> x >> y >> z;
        adj[x].push_back({ y,z });
        adj[y].push_back({ x,z });
    }
    vl disU(n + 1, 1e17), disV(n + 1, 1e17);
    dijkstra(u, adj, disU);
    dijkstra(v, adj, disV);
    vl parent[n + 1];
    vl adj2[n + 1];
    queue<int> q;
    q.push(t);
    vector<bool> check(n + 1, false);
    dijkstra2(s, adj, parent, n);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (int it : parent[node]) {
            if (!check[it]) {
                check[it] = true;
                q.push(it);
            }
            adj2[it].push_back(node);
        }
    }
    ll ans = disU[v];
    bfs(n, s, adj2, disU, disV, ans);
    bfs(n, s, adj2, disV, disU, ans);
    cout << ans << endl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 28116 KB Output is correct
2 Correct 199 ms 27660 KB Output is correct
3 Correct 198 ms 28716 KB Output is correct
4 Correct 196 ms 27804 KB Output is correct
5 Correct 192 ms 28268 KB Output is correct
6 Correct 190 ms 27856 KB Output is correct
7 Correct 209 ms 28812 KB Output is correct
8 Correct 247 ms 28256 KB Output is correct
9 Correct 183 ms 27728 KB Output is correct
10 Correct 165 ms 28076 KB Output is correct
11 Correct 74 ms 21572 KB Output is correct
12 Correct 205 ms 27620 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 28340 KB Output is correct
2 Correct 200 ms 27532 KB Output is correct
3 Correct 194 ms 27536 KB Output is correct
4 Correct 201 ms 27616 KB Output is correct
5 Correct 201 ms 27544 KB Output is correct
6 Correct 203 ms 28640 KB Output is correct
7 Correct 204 ms 28560 KB Output is correct
8 Correct 200 ms 27508 KB Output is correct
9 Correct 212 ms 27512 KB Output is correct
10 Correct 213 ms 27600 KB Output is correct
11 Correct 73 ms 22168 KB Output is correct
12 Correct 193 ms 28604 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2248 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 3932 KB Output is correct
5 Correct 5 ms 2140 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 5 ms 2008 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 28116 KB Output is correct
2 Correct 199 ms 27660 KB Output is correct
3 Correct 198 ms 28716 KB Output is correct
4 Correct 196 ms 27804 KB Output is correct
5 Correct 192 ms 28268 KB Output is correct
6 Correct 190 ms 27856 KB Output is correct
7 Correct 209 ms 28812 KB Output is correct
8 Correct 247 ms 28256 KB Output is correct
9 Correct 183 ms 27728 KB Output is correct
10 Correct 165 ms 28076 KB Output is correct
11 Correct 74 ms 21572 KB Output is correct
12 Correct 205 ms 27620 KB Output is correct
13 Correct 198 ms 28340 KB Output is correct
14 Correct 200 ms 27532 KB Output is correct
15 Correct 194 ms 27536 KB Output is correct
16 Correct 201 ms 27616 KB Output is correct
17 Correct 201 ms 27544 KB Output is correct
18 Correct 203 ms 28640 KB Output is correct
19 Correct 204 ms 28560 KB Output is correct
20 Correct 200 ms 27508 KB Output is correct
21 Correct 212 ms 27512 KB Output is correct
22 Correct 213 ms 27600 KB Output is correct
23 Correct 73 ms 22168 KB Output is correct
24 Correct 193 ms 28604 KB Output is correct
25 Correct 6 ms 2248 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 10 ms 3932 KB Output is correct
29 Correct 5 ms 2140 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 5 ms 2008 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 171 ms 27524 KB Output is correct
41 Correct 173 ms 27500 KB Output is correct
42 Correct 172 ms 27524 KB Output is correct
43 Correct 75 ms 23364 KB Output is correct
44 Correct 78 ms 23364 KB Output is correct
45 Correct 202 ms 30632 KB Output is correct
46 Correct 180 ms 30248 KB Output is correct
47 Correct 184 ms 27800 KB Output is correct
48 Correct 87 ms 22848 KB Output is correct
49 Correct 158 ms 28344 KB Output is correct
50 Correct 186 ms 29604 KB Output is correct
51 Correct 222 ms 30508 KB Output is correct