oj.uz

Submission #678557

# Submission time Handle Problem Language Result Execution time Memory
678557 2023-01-06T07:27:54 Z tranxuanbach Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 325 ms 15520 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;

template <class T>
using min_heap = priority_queue <T, vector <T>, greater <T>>;

const int N = 1e5 + 5;
const ll infll = (ll)1e18 + 7;

int n, m;
int s1, t1, s2, t2;
vpii adj[N];

ll dist[4][N];
ll D;

void bfs(int s, ll* dist){
    fill(dist + 1, dist + n + 1, infll);
    min_heap <pair <ll, int>> pq;
    dist[s] = 0; pq.emplace(0, s);
    while (!pq.empty()){
        ll d; int u; tie(d, u) = pq.top(); pq.pop();
        if (d != dist[u]){
            continue;
        }
        Fora(&edge, adj[u]){
            int v, w; tie(v, w) = edge;
            if (dist[v] > d + w){
                dist[v] = d + w;
                pq.emplace(dist[v], v);
            }
        }
    }
}

bool check_edge(int u, int v, int w){
    return dist[0][u] + w + dist[1][v] == D or dist[0][v] + w + dist[1][u] == D;
}

int a[N];

ll ans = infll;
ll dp[N];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n >> m;
    cin >> s1 >> t1 >> s2 >> t2;
    ForE(i, 1, m){
        int u, v, w; cin >> u >> v >> w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }

    bfs(s1, dist[0]);
    bfs(t1, dist[1]);
    bfs(s2, dist[2]);
    bfs(t2, dist[3]);
    D = dist[0][t1];

    iota(a + 1, a + n + 1, 1);
    sort(a + 1, a + n + 1, [&](int u, int v){
        return dist[0][u] < dist[0][v];
    });

    fill(dp + 1, dp + n + 1, infll);
    ForE(i, 1, n){
        int u = a[i];

        Fora(&edge, adj[u]){
            int v, w; tie(v, w) = edge;
            if (check_edge(u, v, w)){
                dp[u] = min(dp[u], dp[v]);
            }
        }
        dp[u] = min(dp[u], dist[2][u]);
        ans = min(ans, dp[u] + dist[3][u]);
    }

    fill(dp + 1, dp + n + 1, infll);
    ForE(i, 1, n){
        int u = a[i];

        Fora(&edge, adj[u]){
            int v, w; tie(v, w) = edge;
            if (check_edge(u, v, w)){
                dp[u] = min(dp[u], dp[v]);
            }
        }
        dp[u] = min(dp[u], dist[3][u]);
        ans = min(ans, dp[u] + dist[2][u]);
    }

    cout << ans << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 15520 KB Output is correct
2 Correct 284 ms 14164 KB Output is correct
3 Correct 271 ms 15076 KB Output is correct
4 Correct 279 ms 15384 KB Output is correct
5 Correct 268 ms 14088 KB Output is correct
6 Correct 282 ms 15484 KB Output is correct
7 Correct 294 ms 14020 KB Output is correct
8 Correct 246 ms 14108 KB Output is correct
9 Correct 276 ms 14024 KB Output is correct
10 Correct 202 ms 14008 KB Output is correct
11 Correct 100 ms 10312 KB Output is correct
12 Correct 280 ms 14200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 14288 KB Output is correct
2 Correct 277 ms 14224 KB Output is correct
3 Correct 275 ms 14224 KB Output is correct
4 Correct 259 ms 14188 KB Output is correct
5 Correct 312 ms 14328 KB Output is correct
6 Correct 244 ms 13996 KB Output is correct
7 Correct 309 ms 14128 KB Output is correct
8 Correct 303 ms 14416 KB Output is correct
9 Correct 285 ms 14132 KB Output is correct
10 Correct 315 ms 14192 KB Output is correct
11 Correct 114 ms 10272 KB Output is correct
12 Correct 315 ms 14044 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3668 KB Output is correct
2 Correct 2 ms 2684 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 15 ms 4324 KB Output is correct
5 Correct 10 ms 3612 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 4 ms 2900 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 11 ms 3668 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2708 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 15520 KB Output is correct
2 Correct 284 ms 14164 KB Output is correct
3 Correct 271 ms 15076 KB Output is correct
4 Correct 279 ms 15384 KB Output is correct
5 Correct 268 ms 14088 KB Output is correct
6 Correct 282 ms 15484 KB Output is correct
7 Correct 294 ms 14020 KB Output is correct
8 Correct 246 ms 14108 KB Output is correct
9 Correct 276 ms 14024 KB Output is correct
10 Correct 202 ms 14008 KB Output is correct
11 Correct 100 ms 10312 KB Output is correct
12 Correct 280 ms 14200 KB Output is correct
13 Correct 270 ms 14288 KB Output is correct
14 Correct 277 ms 14224 KB Output is correct
15 Correct 275 ms 14224 KB Output is correct
16 Correct 259 ms 14188 KB Output is correct
17 Correct 312 ms 14328 KB Output is correct
18 Correct 244 ms 13996 KB Output is correct
19 Correct 309 ms 14128 KB Output is correct
20 Correct 303 ms 14416 KB Output is correct
21 Correct 285 ms 14132 KB Output is correct
22 Correct 315 ms 14192 KB Output is correct
23 Correct 114 ms 10272 KB Output is correct
24 Correct 315 ms 14044 KB Output is correct
25 Correct 8 ms 3668 KB Output is correct
26 Correct 2 ms 2684 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 15 ms 4324 KB Output is correct
29 Correct 10 ms 3612 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 11 ms 3668 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2708 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2688 KB Output is correct
40 Correct 269 ms 15460 KB Output is correct
41 Correct 291 ms 14108 KB Output is correct
42 Correct 268 ms 14204 KB Output is correct
43 Correct 117 ms 10316 KB Output is correct
44 Correct 116 ms 10304 KB Output is correct
45 Correct 227 ms 14332 KB Output is correct
46 Correct 240 ms 13976 KB Output is correct
47 Correct 247 ms 15352 KB Output is correct
48 Correct 129 ms 10316 KB Output is correct
49 Correct 222 ms 15492 KB Output is correct
50 Correct 260 ms 13948 KB Output is correct
51 Correct 216 ms 13756 KB Output is correct