oj.uz

답안 #546725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546725 2022-04-08T09:32:02 Z someone Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 427 ms 27532 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
struct Arc {
    int nex, pds;
};
 
struct Sit {
    int i, t;
    
    bool operator <(const Sit& other) const {
        return t > other.t;
    }
};
 
const int N = 1e5 + 42, INF = 1e18 + 42;

bool vu[N];
vector<Arc> adj[N];
int n, m, s, t, u, v, dist[N][4], distv[N], distu[N];

void Dijkstra(int deb, int id) {
    for(int i = 0; i < n; i++)
        dist[i][id] = INF;
    dist[deb][id] = 0;
    priority_queue<Sit> q;
    q.push({deb, 0});
    while(!q.empty()) {
        int i = q.top().i, t = q.top().t;
        q.pop();
        if(t == dist[i][id]) {
            for(Arc arc : adj[i]) {
                if(dist[arc.nex][id] > t + arc.pds) {
                    dist[arc.nex][id] = t + arc.pds;
                    q.push({arc.nex, dist[arc.nex][id]});
                }
            }
        }
    }
}

void DFS(int i) {
    if(vu[i])
        return;
    vu[i] = true;
    distu[i] = dist[i][2];
    distv[i] = dist[i][3];
    for(Arc arc : adj[i])
        if(dist[i][0] + arc.pds == dist[arc.nex][0] && dist[arc.nex][0] + dist[arc.nex][1] == dist[t][0]) {
            DFS(arc.nex);
            distu[i] = min(distu[i], distu[arc.nex]);
            distv[i] = min(distv[i], distv[arc.nex]);
        }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m >> s >> t >> u >> v;
    s--, t--, u--, v--;
    for(int i = 0; i < m; i++) {
        int a, b, pds;
        cin >> a >> b >> pds;
        a--, b--;
        adj[a].push_back({b, pds});
        adj[b].push_back({a, pds});
    }
    
    Dijkstra(s, 0);
    Dijkstra(t, 1);
    Dijkstra(u, 2);
    Dijkstra(v, 3);
    
    for(int i = 0; i < n; i++)
        distu[i] = distv[i] = INF;
    DFS(s);
    
    int ans = dist[v][2];
    for(int i = 0; i < n; i++)
        ans = min(ans, min(distv[i] + dist[i][2], distu[i] + dist[i][3]));
    cout << ans;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 19296 KB Output is correct
2 Correct 333 ms 18164 KB Output is correct
3 Correct 372 ms 27532 KB Output is correct
4 Correct 314 ms 22948 KB Output is correct
5 Correct 351 ms 21544 KB Output is correct
6 Correct 343 ms 23244 KB Output is correct
7 Correct 346 ms 21612 KB Output is correct
8 Correct 377 ms 21636 KB Output is correct
9 Correct 306 ms 22376 KB Output is correct
10 Correct 267 ms 22292 KB Output is correct
11 Correct 155 ms 17288 KB Output is correct
12 Correct 364 ms 22196 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 19720 KB Output is correct
2 Correct 370 ms 19980 KB Output is correct
3 Correct 327 ms 19652 KB Output is correct
4 Correct 385 ms 19892 KB Output is correct
5 Correct 362 ms 20340 KB Output is correct
6 Correct 376 ms 21732 KB Output is correct
7 Correct 372 ms 22016 KB Output is correct
8 Correct 351 ms 19972 KB Output is correct
9 Correct 387 ms 20340 KB Output is correct
10 Correct 394 ms 19728 KB Output is correct
11 Correct 193 ms 16556 KB Output is correct
12 Correct 323 ms 21924 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4052 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2684 KB Output is correct
4 Correct 14 ms 6100 KB Output is correct
5 Correct 9 ms 4356 KB Output is correct
6 Correct 2 ms 2736 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 8 ms 4436 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2692 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 19296 KB Output is correct
2 Correct 333 ms 18164 KB Output is correct
3 Correct 372 ms 27532 KB Output is correct
4 Correct 314 ms 22948 KB Output is correct
5 Correct 351 ms 21544 KB Output is correct
6 Correct 343 ms 23244 KB Output is correct
7 Correct 346 ms 21612 KB Output is correct
8 Correct 377 ms 21636 KB Output is correct
9 Correct 306 ms 22376 KB Output is correct
10 Correct 267 ms 22292 KB Output is correct
11 Correct 155 ms 17288 KB Output is correct
12 Correct 364 ms 22196 KB Output is correct
13 Correct 427 ms 19720 KB Output is correct
14 Correct 370 ms 19980 KB Output is correct
15 Correct 327 ms 19652 KB Output is correct
16 Correct 385 ms 19892 KB Output is correct
17 Correct 362 ms 20340 KB Output is correct
18 Correct 376 ms 21732 KB Output is correct
19 Correct 372 ms 22016 KB Output is correct
20 Correct 351 ms 19972 KB Output is correct
21 Correct 387 ms 20340 KB Output is correct
22 Correct 394 ms 19728 KB Output is correct
23 Correct 193 ms 16556 KB Output is correct
24 Correct 323 ms 21924 KB Output is correct
25 Correct 7 ms 4052 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2684 KB Output is correct
28 Correct 14 ms 6100 KB Output is correct
29 Correct 9 ms 4356 KB Output is correct
30 Correct 2 ms 2736 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 8 ms 4436 KB Output is correct
35 Correct 2 ms 2684 KB Output is correct
36 Correct 3 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2692 KB Output is correct
40 Correct 275 ms 23060 KB Output is correct
41 Correct 292 ms 22292 KB Output is correct
42 Correct 359 ms 22332 KB Output is correct
43 Correct 124 ms 17900 KB Output is correct
44 Correct 130 ms 17944 KB Output is correct
45 Correct 364 ms 22296 KB Output is correct
46 Correct 275 ms 21208 KB Output is correct
47 Correct 293 ms 23024 KB Output is correct
48 Correct 179 ms 15308 KB Output is correct
49 Correct 289 ms 22816 KB Output is correct
50 Correct 338 ms 21428 KB Output is correct
51 Correct 291 ms 21336 KB Output is correct