oj.uz

Submission #979163

# Submission time Handle Problem Language Result Execution time Memory
979163 2024-05-10T10:23:21 Z kilkuwu Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 245 ms 22704 KB 
#include <bits/stdc++.h>

#define nl '\n'

template <typename T> 
inline bool ckmin(T& x, const T& y) {
  return y < x ? x = y, 1 : 0;
}


signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int N, M, S, T, U, V;
  std::cin >> N >> M >> S >> T >> U >> V;
  --S, --T, --U, --V;

  std::vector<std::vector<std::pair<int, int>>> adj(N);

  for (int i = 0; i < M; i++) {
    int u, v, w;
    std::cin >> u >> v >> w;
    --u, --v;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
  }

  auto dijkstra = [&](int st) -> std::vector<int64_t> {
    std::vector<int64_t> dp(N, 1e18);
    dp[st] = 0;

    std::priority_queue<std::pair<int64_t, int>> pq;
    pq.emplace(dp[st], st);

    while (pq.size()) {
      auto [d, u] = pq.top();
      pq.pop();

      d = -d;

      if (dp[u] < d) continue;

      for (auto [v, w] : adj[u]) {
        auto nd = d + w;
        if (nd < dp[v]) {
          dp[v] = nd;
          pq.emplace(-dp[v], v);
        }
      }
    }

    return dp;
  };

  auto dpU = dijkstra(U);
  auto dpV = dijkstra(V);

  auto dijkstra2 = [&](int st, std::vector<int64_t>& minU,
                       std::vector<int64_t>& minV) -> std::vector<int64_t> {

    std::vector<int64_t> dp(N, 1e18);
    dp[st] = 0;

    minU.assign(N, 1e18);
    minV.assign(N, 1e18);

    std::priority_queue<std::pair<int64_t, int>> pq;
    pq.emplace(dp[st], st);

    while (pq.size()) {
      auto [d, u] = pq.top();
      pq.pop();

      d = -d;

      if (dp[u] < d) continue;

      ckmin(minU[u], dpU[u]);
      ckmin(minV[u], dpV[u]);          

      for (auto [v, w] : adj[u]) {
        auto nd = d + w;
        if (nd == dp[v]) {
          ckmin(minU[v], minU[u]);
          ckmin(minV[v], minV[u]);
        } else if (nd < dp[v]) {
          minU[v] = minU[u];
          minV[v] = minV[u];
          dp[v] = nd;
          pq.emplace(-dp[v], v);
        }
      }
    }

    return dp;
  };


  std::vector<int64_t> minSU, minSV, minTU, minTV;

  auto dpS = dijkstra2(S, minSU, minSV);
  auto dpT = dijkstra2(T, minTU, minTV);

  int64_t ans = dpU[V];
  for (int i = 0; i < N; i++) {
    if (dpS[i] + dpT[i] == dpS[T]) {
      // this is an edge 
      ckmin(ans, minSU[i] + minTV[i]);
      ckmin(ans, minSV[i] + minTU[i]);
    }
  }

  std::cout << ans << nl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 22120 KB Output is correct
2 Correct 179 ms 20560 KB Output is correct
3 Correct 187 ms 21936 KB Output is correct
4 Correct 175 ms 20996 KB Output is correct
5 Correct 168 ms 20324 KB Output is correct
6 Correct 209 ms 22292 KB Output is correct
7 Correct 173 ms 20608 KB Output is correct
8 Correct 178 ms 20616 KB Output is correct
9 Correct 245 ms 21460 KB Output is correct
10 Correct 141 ms 21320 KB Output is correct
11 Correct 52 ms 14232 KB Output is correct
12 Correct 197 ms 21340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 20932 KB Output is correct
2 Correct 202 ms 20712 KB Output is correct
3 Correct 199 ms 20560 KB Output is correct
4 Correct 197 ms 20632 KB Output is correct
5 Correct 203 ms 20544 KB Output is correct
6 Correct 173 ms 20984 KB Output is correct
7 Correct 211 ms 20424 KB Output is correct
8 Correct 187 ms 20668 KB Output is correct
9 Correct 198 ms 20648 KB Output is correct
10 Correct 210 ms 20664 KB Output is correct
11 Correct 59 ms 14160 KB Output is correct
12 Correct 179 ms 21024 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1372 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 2396 KB Output is correct
5 Correct 5 ms 1372 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 22120 KB Output is correct
2 Correct 179 ms 20560 KB Output is correct
3 Correct 187 ms 21936 KB Output is correct
4 Correct 175 ms 20996 KB Output is correct
5 Correct 168 ms 20324 KB Output is correct
6 Correct 209 ms 22292 KB Output is correct
7 Correct 173 ms 20608 KB Output is correct
8 Correct 178 ms 20616 KB Output is correct
9 Correct 245 ms 21460 KB Output is correct
10 Correct 141 ms 21320 KB Output is correct
11 Correct 52 ms 14232 KB Output is correct
12 Correct 197 ms 21340 KB Output is correct
13 Correct 191 ms 20932 KB Output is correct
14 Correct 202 ms 20712 KB Output is correct
15 Correct 199 ms 20560 KB Output is correct
16 Correct 197 ms 20632 KB Output is correct
17 Correct 203 ms 20544 KB Output is correct
18 Correct 173 ms 20984 KB Output is correct
19 Correct 211 ms 20424 KB Output is correct
20 Correct 187 ms 20668 KB Output is correct
21 Correct 198 ms 20648 KB Output is correct
22 Correct 210 ms 20664 KB Output is correct
23 Correct 59 ms 14160 KB Output is correct
24 Correct 179 ms 21024 KB Output is correct
25 Correct 5 ms 1372 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 10 ms 2396 KB Output is correct
29 Correct 5 ms 1372 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 5 ms 1372 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 188 ms 22704 KB Output is correct
41 Correct 207 ms 21272 KB Output is correct
42 Correct 191 ms 21448 KB Output is correct
43 Correct 83 ms 14164 KB Output is correct
44 Correct 66 ms 14164 KB Output is correct
45 Correct 161 ms 20256 KB Output is correct
46 Correct 177 ms 20124 KB Output is correct
47 Correct 187 ms 22080 KB Output is correct
48 Correct 64 ms 13652 KB Output is correct
49 Correct 168 ms 22204 KB Output is correct
50 Correct 170 ms 20404 KB Output is correct
51 Correct 151 ms 20144 KB Output is correct