oj.uz

Submission #545741

# Submission time Handle Problem Language Result Execution time Memory
545741 2022-04-05T10:28:13 Z Jomnoi Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 360 ms 20176 KB 
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;

const int N = 1e5 + 10;
const long long INF = 1e18 + 7;

vector <pair <int, int>> adj[N];

int n;
long long ans;
long long dist[4][N], dist2[N];
bool visited[4][N], visited2[N];

void Dijkstra(int id, int s) {
    fill(dist[id], dist[id] + n + 1, INF);

    priority_queue <pair <long long, int>> pq;
    pq.emplace(0, s);
    dist[id][s] = 0;
    while(!pq.empty()) {
        int u = pq.top().second;
        pq.pop();

        if(visited[id][u] == true) {
            continue;
        }
        visited[id][u] = true;
        for(auto [v, w] : adj[u]) {
            if(visited[id][v] == false and dist[id][u] + w < dist[id][v]) {
                dist[id][v] = dist[id][u] + w;
                pq.emplace(-dist[id][v], v);
            }
        }
    }
}

void dfs(int id, int u) {
    dist2[u] = dist[3][u];
    visited2[u] = true;
    for(auto [v, w] : adj[u]) {
        if(dist[id ^ 1][v] + w == dist[id ^ 1][u]) {
            if(visited2[v] == false) {
                dfs(id, v);
            }
            dist2[u] = min(dist2[u], dist2[v]);
        }
    }
    ans = min(ans, dist2[u] + dist[2][u]);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int m, S, T, U, V;
    cin >> n >> m >> S >> T >> U >> V;
    while(m--) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].emplace_back(b, c);
        adj[b].emplace_back(a, c);
    }

    Dijkstra(0, S);
    Dijkstra(1, T);
    Dijkstra(2, U);
    Dijkstra(3, V);

    ans = dist[2][V];

    dfs(0, S);
    fill(visited2, visited2 + n + 1, false);
    dfs(1, T);

    cout << ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 15640 KB Output is correct
2 Correct 328 ms 14276 KB Output is correct
3 Correct 334 ms 20176 KB Output is correct
4 Correct 281 ms 15508 KB Output is correct
5 Correct 358 ms 14184 KB Output is correct
6 Correct 353 ms 15616 KB Output is correct
7 Correct 310 ms 14144 KB Output is correct
8 Correct 358 ms 14152 KB Output is correct
9 Correct 288 ms 14196 KB Output is correct
10 Correct 242 ms 14096 KB Output is correct
11 Correct 114 ms 13472 KB Output is correct
12 Correct 296 ms 14212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 15524 KB Output is correct
2 Correct 323 ms 15896 KB Output is correct
3 Correct 360 ms 15504 KB Output is correct
4 Correct 300 ms 15804 KB Output is correct
5 Correct 300 ms 16400 KB Output is correct
6 Correct 323 ms 18108 KB Output is correct
7 Correct 321 ms 18532 KB Output is correct
8 Correct 329 ms 15892 KB Output is correct
9 Correct 349 ms 16424 KB Output is correct
10 Correct 296 ms 15604 KB Output is correct
11 Correct 101 ms 15012 KB Output is correct
12 Correct 273 ms 18372 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3436 KB Output is correct
2 Correct 3 ms 2684 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 18 ms 4744 KB Output is correct
5 Correct 8 ms 3700 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 3 ms 2816 KB Output is correct
10 Correct 8 ms 3708 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 15640 KB Output is correct
2 Correct 328 ms 14276 KB Output is correct
3 Correct 334 ms 20176 KB Output is correct
4 Correct 281 ms 15508 KB Output is correct
5 Correct 358 ms 14184 KB Output is correct
6 Correct 353 ms 15616 KB Output is correct
7 Correct 310 ms 14144 KB Output is correct
8 Correct 358 ms 14152 KB Output is correct
9 Correct 288 ms 14196 KB Output is correct
10 Correct 242 ms 14096 KB Output is correct
11 Correct 114 ms 13472 KB Output is correct
12 Correct 296 ms 14212 KB Output is correct
13 Correct 335 ms 15524 KB Output is correct
14 Correct 323 ms 15896 KB Output is correct
15 Correct 360 ms 15504 KB Output is correct
16 Correct 300 ms 15804 KB Output is correct
17 Correct 300 ms 16400 KB Output is correct
18 Correct 323 ms 18108 KB Output is correct
19 Correct 321 ms 18532 KB Output is correct
20 Correct 329 ms 15892 KB Output is correct
21 Correct 349 ms 16424 KB Output is correct
22 Correct 296 ms 15604 KB Output is correct
23 Correct 101 ms 15012 KB Output is correct
24 Correct 273 ms 18372 KB Output is correct
25 Correct 10 ms 3436 KB Output is correct
26 Correct 3 ms 2684 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 18 ms 4744 KB Output is correct
29 Correct 8 ms 3700 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 3 ms 2816 KB Output is correct
34 Correct 8 ms 3708 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 240 ms 19872 KB Output is correct
41 Correct 299 ms 18728 KB Output is correct
42 Correct 239 ms 18556 KB Output is correct
43 Correct 120 ms 16172 KB Output is correct
44 Correct 115 ms 16124 KB Output is correct
45 Correct 258 ms 17716 KB Output is correct
46 Correct 333 ms 17044 KB Output is correct
47 Correct 256 ms 19204 KB Output is correct
48 Correct 146 ms 13176 KB Output is correct
49 Correct 236 ms 19448 KB Output is correct
50 Correct 307 ms 17664 KB Output is correct
51 Correct 262 ms 17372 KB Output is correct