oj.uz

답안 #538438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538438 2022-03-16T22:42:02 Z MohamedFaresNebili Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 467 ms 31124 KB 
#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")

        using namespace std;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;
        using db = double;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) x.begin(), x.end()
        #define lb lower_bound
        #define ub upper_bound

        const ll INF = LONG_LONG_MAX / 2;

        using pi = pair<ll, ii>;

        ll n, m, s, t, u, v;
        vector<array<ll, 2>> adj[100001];
        ll disU[100001], disV[100001];
        ll dp[2][100001], res;

        void dijkstra(ll src, ll arr[]) {
            for(ll l = 1; l <= n; l++) arr[l] = INF;
            priority_queue<ii, vector<ii>, greater<ii>> pq;
            arr[src] = 0; pq.push({0, src});
            while(!pq.empty()) {
                ll a = pq.top().ss; ll w = pq.top().ff; pq.pop();
                if(arr[a] < w) continue;
                for(auto e : adj[a]) {
                    ll len = e[1] + w; ll to = e[0];
                    if(arr[to] <= len) continue;
                    arr[to] = len; pq.push({len, to});
                }
            }
        }
        void dijkstra0() {
            for(ll l = 0; l <= n; l++) dp[0][l] = dp[1][l] = INF;
            priority_queue<pi, vector<pi>, greater<pi>> pq;
            pq.push({0, {s, 0}}); vector<bool> vis(n + 1, 0);
            vector<long long> dis(n + 1, INF);
            while(!pq.empty()) {
                ll a = pq.top().ss.ff, par = pq.top().ss.ss;
                ll w = pq.top().ff; pq.pop();
                if(!vis[a]) {
                    vis[a] = 1; dis[a] = w;
                    dp[0][a] = min(disU[a], dp[0][par]);
                    dp[1][a] = min(disV[a], dp[1][par]);
                    for(auto u : adj[a]) {
                        pq.push({u[1] + w, {u[0], a}});
                    }
                }
                else if(w == dis[a])
                    if(min(dp[0][par], disU[a]) + min(dp[1][par], disV[a]) <= dp[0][a] + dp[1][a]) {
                        dp[0][a] = min(disU[a], dp[0][par]);
                        dp[1][a] = min(disV[a], dp[1][par]);
                    }
            }
            res = min(res, dp[0][t] + dp[1][t]);
        }

        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> n >> m >> s >> t >> u >> v;
            for(ll l = 0; l < m; l++) {
                ll x, y; ll w; cin >> x >> y >> w;
                adj[x].pb({y, w}); adj[y].pb({x, w});
            }
            dijkstra(u, disU); dijkstra(v, disV);
            res = disU[v]; dijkstra0();
            swap(s, t); dijkstra0();
            cout << res << "\n";
        }

/**
8 8
5 7
6 8
1 2 2
2 3 3
3 4 4
1 4 1
1 5 5
2 6 6
3 7 7
4 8 8
**/

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 27176 KB Output is correct
2 Correct 377 ms 26728 KB Output is correct
3 Correct 398 ms 26148 KB Output is correct
4 Correct 410 ms 26224 KB Output is correct
5 Correct 378 ms 22976 KB Output is correct
6 Correct 447 ms 27060 KB Output is correct
7 Correct 377 ms 26400 KB Output is correct
8 Correct 420 ms 26692 KB Output is correct
9 Correct 467 ms 26912 KB Output is correct
10 Correct 382 ms 27508 KB Output is correct
11 Correct 145 ms 12716 KB Output is correct
12 Correct 411 ms 28120 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 435 ms 26868 KB Output is correct
2 Correct 376 ms 23028 KB Output is correct
3 Correct 408 ms 26172 KB Output is correct
4 Correct 391 ms 23144 KB Output is correct
5 Correct 376 ms 22800 KB Output is correct
6 Correct 405 ms 26244 KB Output is correct
7 Correct 399 ms 22908 KB Output is correct
8 Correct 377 ms 23184 KB Output is correct
9 Correct 397 ms 22836 KB Output is correct
10 Correct 379 ms 26200 KB Output is correct
11 Correct 141 ms 11836 KB Output is correct
12 Correct 373 ms 26184 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5240 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 48 ms 7736 KB Output is correct
5 Correct 23 ms 6432 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 4 ms 2900 KB Output is correct
8 Correct 5 ms 3028 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 24 ms 6384 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2608 KB Output is correct
13 Correct 2 ms 2680 KB Output is correct
14 Correct 3 ms 2812 KB Output is correct
15 Correct 3 ms 2900 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 27176 KB Output is correct
2 Correct 377 ms 26728 KB Output is correct
3 Correct 398 ms 26148 KB Output is correct
4 Correct 410 ms 26224 KB Output is correct
5 Correct 378 ms 22976 KB Output is correct
6 Correct 447 ms 27060 KB Output is correct
7 Correct 377 ms 26400 KB Output is correct
8 Correct 420 ms 26692 KB Output is correct
9 Correct 467 ms 26912 KB Output is correct
10 Correct 382 ms 27508 KB Output is correct
11 Correct 145 ms 12716 KB Output is correct
12 Correct 411 ms 28120 KB Output is correct
13 Correct 435 ms 26868 KB Output is correct
14 Correct 376 ms 23028 KB Output is correct
15 Correct 408 ms 26172 KB Output is correct
16 Correct 391 ms 23144 KB Output is correct
17 Correct 376 ms 22800 KB Output is correct
18 Correct 405 ms 26244 KB Output is correct
19 Correct 399 ms 22908 KB Output is correct
20 Correct 377 ms 23184 KB Output is correct
21 Correct 397 ms 22836 KB Output is correct
22 Correct 379 ms 26200 KB Output is correct
23 Correct 141 ms 11836 KB Output is correct
24 Correct 373 ms 26184 KB Output is correct
25 Correct 26 ms 5240 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 48 ms 7736 KB Output is correct
29 Correct 23 ms 6432 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 4 ms 2900 KB Output is correct
32 Correct 5 ms 3028 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 24 ms 6384 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2608 KB Output is correct
37 Correct 2 ms 2680 KB Output is correct
38 Correct 3 ms 2812 KB Output is correct
39 Correct 3 ms 2900 KB Output is correct
40 Correct 407 ms 30884 KB Output is correct
41 Correct 436 ms 31124 KB Output is correct
42 Correct 454 ms 31060 KB Output is correct
43 Correct 121 ms 13904 KB Output is correct
44 Correct 149 ms 13940 KB Output is correct
45 Correct 402 ms 24964 KB Output is correct
46 Correct 379 ms 24728 KB Output is correct
47 Correct 416 ms 26596 KB Output is correct
48 Correct 131 ms 13368 KB Output is correct
49 Correct 406 ms 29460 KB Output is correct
50 Correct 368 ms 25072 KB Output is correct
51 Correct 392 ms 25092 KB Output is correct