oj.uz

답안 #524797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524797 2022-02-10T04:30:41 Z Netr Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 452 ms 25680 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
 
#ifdef DEBUG
#define D(x...) printf(x);
#else
#define D(x...)
#endif
 
const ll MAXN = 1e5 + 5;
const ll INF = 1ll<<62;
 
ll N,M,S,T,U,V,UD[MAXN],VD[MAXN],SD[MAXN],vis[MAXN],ans;
pi dp[MAXN];
 
vector<pi> edge[MAXN];
 
pi dfs(int i){
    D("%d: ud,vd = %d, %d\n", i, UD[i], VD[i])
    if(i == S) return {UD[S],VD[S]};
    if(vis[i]) return dp[i];
    vis[i] = 1;
    ll udist = INF/2, vdist = INF/2;
    for(auto e : edge[i]){
        if(SD[e.first] + e.second == SD[i]){
            auto res = dfs(e.first);
            if(min(UD[i], res.first) + min(VD[i], res.second) < udist + vdist){
                udist = min(UD[i], res.first);
                vdist = min(VD[i], res.second);
            }
        }
    }
    dp[i] = {udist, vdist};
    return {udist, vdist};
}
 
void djikstras(int src, ll *d, ll s){
    priority_queue<pi, vector<pi>, greater<pi>> pq;
    fill(d, d+s+1, INF);
    pq.push({d[src] = 0, src});
    while(!pq.empty()){
        auto t = pq.top(); pq.pop();
        if(d[t.second] != t.first) continue;
        for(auto e : edge[t.second]){
            if(d[t.second] + e.second < d[e.first]){
                pq.push({d[e.first] = d[t.second] + e.second, e.first});
            }
        }
    }
}
 
int main(){
    cin >> N >> M >> S >> T >> U >> V;
    for(int i = 0; i < M; i++){
        ll ai, bi, ci;
        cin >> ai >> bi >> ci;
        edge[bi].push_back({ai, ci});
        edge[ai].push_back({bi, ci});
    }
    djikstras(S, SD, N);
    djikstras(U, UD, N);
    djikstras(V, VD, N);
    ans = UD[V];
    auto res = dfs(T);
    ans = min(ans, res.first + res.second);
    cout << ans << "\n";
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 375 ms 22288 KB Output is correct
2 Correct 368 ms 21384 KB Output is correct
3 Correct 431 ms 25680 KB Output is correct
4 Correct 364 ms 22168 KB Output is correct
5 Correct 375 ms 21220 KB Output is correct
6 Correct 374 ms 22416 KB Output is correct
7 Correct 341 ms 21320 KB Output is correct
8 Correct 357 ms 21288 KB Output is correct
9 Correct 347 ms 21484 KB Output is correct
10 Correct 346 ms 21476 KB Output is correct
11 Correct 179 ms 17180 KB Output is correct
12 Correct 376 ms 21392 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 23160 KB Output is correct
2 Correct 409 ms 23324 KB Output is correct
3 Correct 354 ms 22928 KB Output is correct
4 Correct 385 ms 23244 KB Output is correct
5 Correct 452 ms 23684 KB Output is correct
6 Correct 368 ms 25212 KB Output is correct
7 Correct 408 ms 25368 KB Output is correct
8 Correct 368 ms 23320 KB Output is correct
9 Correct 369 ms 23580 KB Output is correct
10 Correct 361 ms 22972 KB Output is correct
11 Correct 163 ms 18520 KB Output is correct
12 Correct 369 ms 25492 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4420 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 4 ms 2660 KB Output is correct
4 Correct 37 ms 6036 KB Output is correct
5 Correct 25 ms 4280 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 4 ms 2764 KB Output is correct
8 Correct 5 ms 2920 KB Output is correct
9 Correct 3 ms 2792 KB Output is correct
10 Correct 27 ms 4344 KB Output is correct
11 Correct 2 ms 2656 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 2 ms 2656 KB Output is correct
14 Correct 3 ms 2636 KB Output is correct
15 Correct 4 ms 2660 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 375 ms 22288 KB Output is correct
2 Correct 368 ms 21384 KB Output is correct
3 Correct 431 ms 25680 KB Output is correct
4 Correct 364 ms 22168 KB Output is correct
5 Correct 375 ms 21220 KB Output is correct
6 Correct 374 ms 22416 KB Output is correct
7 Correct 341 ms 21320 KB Output is correct
8 Correct 357 ms 21288 KB Output is correct
9 Correct 347 ms 21484 KB Output is correct
10 Correct 346 ms 21476 KB Output is correct
11 Correct 179 ms 17180 KB Output is correct
12 Correct 376 ms 21392 KB Output is correct
13 Correct 365 ms 23160 KB Output is correct
14 Correct 409 ms 23324 KB Output is correct
15 Correct 354 ms 22928 KB Output is correct
16 Correct 385 ms 23244 KB Output is correct
17 Correct 452 ms 23684 KB Output is correct
18 Correct 368 ms 25212 KB Output is correct
19 Correct 408 ms 25368 KB Output is correct
20 Correct 368 ms 23320 KB Output is correct
21 Correct 369 ms 23580 KB Output is correct
22 Correct 361 ms 22972 KB Output is correct
23 Correct 163 ms 18520 KB Output is correct
24 Correct 369 ms 25492 KB Output is correct
25 Correct 24 ms 4420 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 4 ms 2660 KB Output is correct
28 Correct 37 ms 6036 KB Output is correct
29 Correct 25 ms 4280 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 4 ms 2764 KB Output is correct
32 Correct 5 ms 2920 KB Output is correct
33 Correct 3 ms 2792 KB Output is correct
34 Correct 27 ms 4344 KB Output is correct
35 Correct 2 ms 2656 KB Output is correct
36 Correct 3 ms 2636 KB Output is correct
37 Correct 2 ms 2656 KB Output is correct
38 Correct 3 ms 2636 KB Output is correct
39 Correct 4 ms 2660 KB Output is correct
40 Correct 348 ms 22304 KB Output is correct
41 Correct 348 ms 21476 KB Output is correct
42 Correct 362 ms 21508 KB Output is correct
43 Correct 178 ms 17820 KB Output is correct
44 Correct 160 ms 17712 KB Output is correct
45 Correct 334 ms 22100 KB Output is correct
46 Correct 338 ms 20992 KB Output is correct
47 Correct 321 ms 22100 KB Output is correct
48 Correct 152 ms 15204 KB Output is correct
49 Correct 291 ms 22068 KB Output is correct
50 Correct 315 ms 21304 KB Output is correct
51 Correct 349 ms 21288 KB Output is correct