oj.uz

답안 #855202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855202 2023-09-30T16:21:25 Z thaixuandang Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 363 ms 17968 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  int S, T, U, V;
  cin >> S >> T >> U >> V, S--, T--, U--, V--;
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w, u--, v--;
    g[u].emplace_back(v, w);
    g[v].emplace_back(u, w);
  }

  auto dijkstra = [&](int s) {
    vector<long long> dist(n, 1e18);
    priority_queue<pair<long long, int>> pq;
    dist[s] = 0;
    pq.emplace(0, s);
    while (pq.size()) {
      auto d = -pq.top().first;
      auto u = pq.top().second;
      pq.pop();
      if (d > dist[u]) continue;
      for (auto [v, w] : g[u]) {
        if (dist[v] > dist[u] + w) {
          dist[v] = dist[u] + w;
          pq.emplace(-dist[v], v);
        }
      }
    }
    return dist;
  };

  auto solve = [&](int S, int T) {
    auto fromS = dijkstra(S);
    auto fromT = dijkstra(T);
    auto fromU = dijkstra(U);
    auto fromV = dijkstra(V);
    vector<long long> f(n, 1e18);
    // thứ tự quy hoạch động?
    // f[y] cập nhật cho f[x]
    // fromS[y] < fromS[x]
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int x, int y) {
      return fromS[x] < fromS[y];
    });
    long long ans = fromU[V];
    for (auto u : order) {
      f[u] = min(f[u], fromU[u]);
      for (auto [v, w] : g[u]) {
        if (fromS[u] + w == fromS[v] && fromS[u] + w + fromT[v] == fromS[T]) {
          f[v] = min(f[v], f[u]);
        }
      }
      if (fromS[u] + fromT[u] == fromS[T]) {
        ans = min(ans, f[u] + fromV[u]);
      }
    }
    return ans;
  };

  cout << min(solve(S, T), solve(T, S)) << endl;
  return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 17816 KB Output is correct
2 Correct 300 ms 16124 KB Output is correct
3 Correct 298 ms 15916 KB Output is correct
4 Correct 267 ms 17492 KB Output is correct
5 Correct 263 ms 15968 KB Output is correct
6 Correct 316 ms 17968 KB Output is correct
7 Correct 287 ms 15972 KB Output is correct
8 Correct 321 ms 16096 KB Output is correct
9 Correct 316 ms 16080 KB Output is correct
10 Correct 236 ms 16688 KB Output is correct
11 Correct 86 ms 11508 KB Output is correct
12 Correct 312 ms 16240 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 16184 KB Output is correct
2 Correct 321 ms 16096 KB Output is correct
3 Correct 363 ms 16280 KB Output is correct
4 Correct 312 ms 16044 KB Output is correct
5 Correct 359 ms 16164 KB Output is correct
6 Correct 286 ms 15924 KB Output is correct
7 Correct 336 ms 16552 KB Output is correct
8 Correct 318 ms 16328 KB Output is correct
9 Correct 355 ms 16108 KB Output is correct
10 Correct 324 ms 16128 KB Output is correct
11 Correct 91 ms 11344 KB Output is correct
12 Correct 307 ms 15980 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 2276 KB Output is correct
5 Correct 7 ms 1380 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 472 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 6 ms 1372 KB Output is correct
11 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 17816 KB Output is correct
2 Correct 300 ms 16124 KB Output is correct
3 Correct 298 ms 15916 KB Output is correct
4 Correct 267 ms 17492 KB Output is correct
5 Correct 263 ms 15968 KB Output is correct
6 Correct 316 ms 17968 KB Output is correct
7 Correct 287 ms 15972 KB Output is correct
8 Correct 321 ms 16096 KB Output is correct
9 Correct 316 ms 16080 KB Output is correct
10 Correct 236 ms 16688 KB Output is correct
11 Correct 86 ms 11508 KB Output is correct
12 Correct 312 ms 16240 KB Output is correct
13 Correct 313 ms 16184 KB Output is correct
14 Correct 321 ms 16096 KB Output is correct
15 Correct 363 ms 16280 KB Output is correct
16 Correct 312 ms 16044 KB Output is correct
17 Correct 359 ms 16164 KB Output is correct
18 Correct 286 ms 15924 KB Output is correct
19 Correct 336 ms 16552 KB Output is correct
20 Correct 318 ms 16328 KB Output is correct
21 Correct 355 ms 16108 KB Output is correct
22 Correct 324 ms 16128 KB Output is correct
23 Correct 91 ms 11344 KB Output is correct
24 Correct 307 ms 15980 KB Output is correct
25 Correct 6 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 2276 KB Output is correct
29 Correct 7 ms 1380 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 472 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 6 ms 1372 KB Output is correct
35 Correct 1 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 284 ms 17628 KB Output is correct
41 Correct 286 ms 16224 KB Output is correct
42 Correct 282 ms 16332 KB Output is correct
43 Correct 84 ms 11392 KB Output is correct
44 Correct 87 ms 11388 KB Output is correct
45 Correct 250 ms 15528 KB Output is correct
46 Correct 315 ms 15484 KB Output is correct
47 Correct 308 ms 17460 KB Output is correct
48 Correct 98 ms 11124 KB Output is correct
49 Correct 223 ms 17648 KB Output is correct
50 Correct 306 ms 16008 KB Output is correct
51 Correct 230 ms 15616 KB Output is correct