oj.uz

Submission #788730

# Submission time Handle Problem Language Result Execution time Memory
788730 2023-07-20T14:32:49 Z tch1cherin Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 282 ms 15292 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1e5 + 5;
vector<pair<int, int>> G[MAX_N];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M, S, T, U, V;
  cin >> N >> M >> S >> T >> U >> V;
  S--, T--, U--, V--;
  for (int i = 0; i < M; i++) {
    int A, B, C;
    cin >> A >> B >> C;
    A--, B--;
    G[A].push_back({B, C});
    G[B].push_back({A, C});
  }
  vector<int> order;
  vector<int64_t> dist(N);
  auto Dijkstra = [&](int start) {
    dist.assign(N, LLONG_MAX);
    order = vector<int>();
    priority_queue<pair<int64_t, int>> q;
    q.push({dist[start] = 0, start});
    while (!q.empty()) {
      auto [d, u] = q.top();
      q.pop();
      if (-d == dist[u]) {
        order.push_back(u);
        for (auto [v, w] : G[u])
          if (dist[u] + w < dist[v])
            q.push({-(dist[v] = w - d), v});
      }
    }
  };
  vector<int64_t> D[4];
  Dijkstra(U), D[0] = dist;
  Dijkstra(V), D[1] = dist;
  Dijkstra(T), D[3] = dist;
  Dijkstra(S), D[2] = dist;
  reverse(order.begin(), order.end());
  int64_t ans = LLONG_MAX;
  for (int u : order) {
    ans = min(ans, D[0][u] + D[1][u]);
    for (auto [v, w] : G[u]) {
      if (D[2][u] + w + D[3][v] == D[2][T]) {
        ans = min({ans, D[0][u] + D[1][v], D[0][v] + D[1][u]});
      }
    }
    for (auto [v, w] : G[u]) {
      if (D[2][u] + w + D[3][v] == D[2][T]) {
        D[0][u] = min(D[0][u], D[0][v]);
        D[1][u] = min(D[1][u], D[1][v]);
      }
    }
  }
  cout << min(D[0][V], ans) << "\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 15140 KB Output is correct
2 Correct 213 ms 13948 KB Output is correct
3 Correct 212 ms 14220 KB Output is correct
4 Correct 190 ms 13932 KB Output is correct
5 Correct 213 ms 13832 KB Output is correct
6 Correct 189 ms 15292 KB Output is correct
7 Correct 195 ms 13916 KB Output is correct
8 Correct 282 ms 13980 KB Output is correct
9 Correct 207 ms 13824 KB Output is correct
10 Correct 147 ms 13828 KB Output is correct
11 Correct 82 ms 10556 KB Output is correct
12 Correct 176 ms 13792 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 14128 KB Output is correct
2 Correct 232 ms 13836 KB Output is correct
3 Correct 183 ms 13892 KB Output is correct
4 Correct 192 ms 13916 KB Output is correct
5 Correct 211 ms 13896 KB Output is correct
6 Correct 224 ms 13804 KB Output is correct
7 Correct 217 ms 13824 KB Output is correct
8 Correct 191 ms 13832 KB Output is correct
9 Correct 191 ms 13816 KB Output is correct
10 Correct 187 ms 13924 KB Output is correct
11 Correct 62 ms 10636 KB Output is correct
12 Correct 218 ms 14184 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3412 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 11 ms 4016 KB Output is correct
5 Correct 6 ms 3284 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 6 ms 3332 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 15140 KB Output is correct
2 Correct 213 ms 13948 KB Output is correct
3 Correct 212 ms 14220 KB Output is correct
4 Correct 190 ms 13932 KB Output is correct
5 Correct 213 ms 13832 KB Output is correct
6 Correct 189 ms 15292 KB Output is correct
7 Correct 195 ms 13916 KB Output is correct
8 Correct 282 ms 13980 KB Output is correct
9 Correct 207 ms 13824 KB Output is correct
10 Correct 147 ms 13828 KB Output is correct
11 Correct 82 ms 10556 KB Output is correct
12 Correct 176 ms 13792 KB Output is correct
13 Correct 192 ms 14128 KB Output is correct
14 Correct 232 ms 13836 KB Output is correct
15 Correct 183 ms 13892 KB Output is correct
16 Correct 192 ms 13916 KB Output is correct
17 Correct 211 ms 13896 KB Output is correct
18 Correct 224 ms 13804 KB Output is correct
19 Correct 217 ms 13824 KB Output is correct
20 Correct 191 ms 13832 KB Output is correct
21 Correct 191 ms 13816 KB Output is correct
22 Correct 187 ms 13924 KB Output is correct
23 Correct 62 ms 10636 KB Output is correct
24 Correct 218 ms 14184 KB Output is correct
25 Correct 7 ms 3412 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 11 ms 4016 KB Output is correct
29 Correct 6 ms 3284 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 6 ms 3332 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 185 ms 15204 KB Output is correct
41 Correct 165 ms 13816 KB Output is correct
42 Correct 172 ms 13876 KB Output is correct
43 Correct 61 ms 10540 KB Output is correct
44 Correct 79 ms 10636 KB Output is correct
45 Correct 196 ms 14120 KB Output is correct
46 Correct 179 ms 14188 KB Output is correct
47 Correct 194 ms 14352 KB Output is correct
48 Correct 79 ms 10512 KB Output is correct
49 Correct 155 ms 15184 KB Output is correct
50 Correct 207 ms 13784 KB Output is correct
51 Correct 160 ms 13848 KB Output is correct