oj.uz

답안 #544527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544527 2022-04-02T08:31:37 Z SavicS Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 334 ms 24856 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 200005; 

int n, m;
int S, T;
int A, B;

vector<pii> g[mxN];

ll dist_S[mxN];
ll dist_T[mxN];
ll dist_A[mxN];
ll dist_B[mxN];

void dij(int s, ll dist[]){
    ff(i,1,n)dist[i] = inf;
    priority_queue<pll, vector<pll>, greater<pll>> pq;

    pq.push({dist[s] = 0, s});
    while(sz(pq)){
        pll v = pq.top(); pq.pop();
        if(dist[v.se] < v.fi)continue;
        for(auto c : g[v.se]){
            int u = c.fi;
            int w = c.se;
            if(dist[u] > v.fi + w){
                pq.push({dist[u] = v.fi + w, u});
            }
        }
    }

}

ll rez = inf;
ll dp[mxN];
bool visited[mxN];

void dfs_S(int v){
    visited[v] = 1; dp[v] = dist_B[v];
    for(auto c : g[v]){
        int u = c.fi;
        int w = c.se;
        if(dist_T[v] == w + dist_T[u]){
            if(!visited[u])dfs_S(u);
            dp[v] = min(dp[v], dp[u]);
        }
    }

    rez = min(rez, dist_A[v] + dp[v]);

}

void dfs_T(int v){
    visited[v] = 1; dp[v] = dist_B[v];
    for(auto c : g[v]){
        int u = c.fi;
        int w = c.se;
        if(dist_S[v] == w + dist_S[u]){
            if(!visited[u])dfs_T(u);
            dp[v] = min(dp[v], dp[u]);
        }
    }

    rez = min(rez, dist_A[v] + dp[v]); 
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m >> S >> T >> A >> B;
    ff(i,1,m){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].pb({v, w});
        g[v].pb({u, w});
    }

    dij(S, dist_S);
    dij(T, dist_T);
    dij(A, dist_A);
    dij(B, dist_B);

    rez = dist_A[B];

    dfs_S(S);
    ff(i,1,n)visited[i] = 0;
    dfs_T(T);

    cout << rez << '\n';


    return 0;
}
/*
 
6 6 
1 6 
1 4 
1 2 1 
2 3 1 
3 5 1 
2 4 3 
4 5 2 
5 6 1

6 5
1 2
3 6
1 2 1000000000 
2 3 1000000000 
3 4 1000000000 
4 5 1000000000 
5 6 1000000000

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

5 5 
1 5 
2 3 
1 2 1 
2 3 10 
2 4 10 
3 5 10 
4 5 10

10 15 
6 8
7 9
2 7 12
8 10 17 
1 3 1
3 8 14
5 7 15
2 3 7
1 10 14 
3 6 12 
1 5 10 
8 9 1 
2 9 7 
1 4 1 
1 8 1 
2 4 7
5 6 16
 
// probati bojenje sahovski
*/

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 18016 KB Output is correct
2 Correct 253 ms 16696 KB Output is correct
3 Correct 288 ms 24856 KB Output is correct
4 Correct 263 ms 21228 KB Output is correct
5 Correct 259 ms 19624 KB Output is correct
6 Correct 253 ms 21488 KB Output is correct
7 Correct 334 ms 19604 KB Output is correct
8 Correct 258 ms 19612 KB Output is correct
9 Correct 260 ms 20596 KB Output is correct
10 Correct 224 ms 20476 KB Output is correct
11 Correct 107 ms 16820 KB Output is correct
12 Correct 276 ms 20428 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 17532 KB Output is correct
2 Correct 272 ms 17968 KB Output is correct
3 Correct 255 ms 17416 KB Output is correct
4 Correct 286 ms 17660 KB Output is correct
5 Correct 295 ms 18192 KB Output is correct
6 Correct 258 ms 19428 KB Output is correct
7 Correct 321 ms 19924 KB Output is correct
8 Correct 275 ms 17796 KB Output is correct
9 Correct 334 ms 18128 KB Output is correct
10 Correct 286 ms 17572 KB Output is correct
11 Correct 105 ms 16460 KB Output is correct
12 Correct 274 ms 19804 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6100 KB Output is correct
2 Correct 3 ms 5044 KB Output is correct
3 Correct 3 ms 5032 KB Output is correct
4 Correct 15 ms 7108 KB Output is correct
5 Correct 10 ms 6052 KB Output is correct
6 Correct 4 ms 5048 KB Output is correct
7 Correct 4 ms 5172 KB Output is correct
8 Correct 4 ms 5168 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 9 ms 6108 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5080 KB Output is correct
13 Correct 4 ms 5028 KB Output is correct
14 Correct 3 ms 5060 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 18016 KB Output is correct
2 Correct 253 ms 16696 KB Output is correct
3 Correct 288 ms 24856 KB Output is correct
4 Correct 263 ms 21228 KB Output is correct
5 Correct 259 ms 19624 KB Output is correct
6 Correct 253 ms 21488 KB Output is correct
7 Correct 334 ms 19604 KB Output is correct
8 Correct 258 ms 19612 KB Output is correct
9 Correct 260 ms 20596 KB Output is correct
10 Correct 224 ms 20476 KB Output is correct
11 Correct 107 ms 16820 KB Output is correct
12 Correct 276 ms 20428 KB Output is correct
13 Correct 323 ms 17532 KB Output is correct
14 Correct 272 ms 17968 KB Output is correct
15 Correct 255 ms 17416 KB Output is correct
16 Correct 286 ms 17660 KB Output is correct
17 Correct 295 ms 18192 KB Output is correct
18 Correct 258 ms 19428 KB Output is correct
19 Correct 321 ms 19924 KB Output is correct
20 Correct 275 ms 17796 KB Output is correct
21 Correct 334 ms 18128 KB Output is correct
22 Correct 286 ms 17572 KB Output is correct
23 Correct 105 ms 16460 KB Output is correct
24 Correct 274 ms 19804 KB Output is correct
25 Correct 10 ms 6100 KB Output is correct
26 Correct 3 ms 5044 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 15 ms 7108 KB Output is correct
29 Correct 10 ms 6052 KB Output is correct
30 Correct 4 ms 5048 KB Output is correct
31 Correct 4 ms 5172 KB Output is correct
32 Correct 4 ms 5168 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 9 ms 6108 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5080 KB Output is correct
37 Correct 4 ms 5028 KB Output is correct
38 Correct 3 ms 5060 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 238 ms 21800 KB Output is correct
41 Correct 289 ms 20428 KB Output is correct
42 Correct 269 ms 20516 KB Output is correct
43 Correct 157 ms 17320 KB Output is correct
44 Correct 207 ms 17396 KB Output is correct
45 Correct 284 ms 19688 KB Output is correct
46 Correct 256 ms 19104 KB Output is correct
47 Correct 238 ms 21216 KB Output is correct
48 Correct 123 ms 14768 KB Output is correct
49 Correct 256 ms 21468 KB Output is correct
50 Correct 245 ms 19540 KB Output is correct
51 Correct 238 ms 19248 KB Output is correct