Submission #293400

# Submission time Handle Problem Language Result Execution time Memory
293400 2020-09-08T02:51:00 Z rama_pang Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
451 ms 20724 KB
#include <bits/stdc++.h>
using namespace std;
using lint = long long;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  int N, M, S, T, U, V;
  cin >> N >> M >> S >> T >> U >> V;
  S--, T--, U--, V--;
  vector<vector<pair<int, int>>> adj(N);
  for (int i = 0; i < M; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
  }

  auto Dijkstra = [&](int s) {
    vector<lint> dist(N, -1);
    priority_queue<pair<lint, int>, vector<pair<lint, int>>, greater<pair<lint, int>>> pq;
    pq.emplace(0, s);
    dist[s] = 0;
    while (!pq.empty()) {
      int u = pq.top().second;
      lint d = pq.top().first;
      pq.pop();
      if (dist[u] != d) {
        continue;
      }
      for (auto v : adj[u]) {
        if (dist[v.first] == -1 || dist[v.first] > dist[u] + v.second) {
          dist[v.first] = dist[u] + v.second;
          pq.emplace(dist[v.first], v.first);
        }
      }
    }
    return dist;
  };

  vector<lint> dS = Dijkstra(S);
  vector<lint> dT = Dijkstra(T);
  vector<lint> dU = Dijkstra(U);
  vector<lint> dV = Dijkstra(V);

  vector<int> order(N);
  iota(begin(order), end(order), 0);
  sort(begin(order), end(order), [&](int i, int j) {
    return dS[i] < dS[j];
  });

  auto Calc = [&](int A, int B, vector<lint> dA, vector<lint> dB) {
    vector<lint> dp(N);
    lint ans = 1e18;
    for (auto u : order) {
      if (dS[u] + dT[u] == dS[T]) {
        dp[u] = dA[u];
        for (auto v : adj[u]) if (dS[v.first] + dT[v.first] == dS[T] && dS[v.first] < dS[u]) {
          dp[u] = min(dp[u], dp[v.first]);
        }
        ans = min(ans, dp[u] + dB[u]);
      } else {
        ans = min(ans, dA[u] + dB[u]);
      }
    }
    return ans;
  };

  cout << min(Calc(U, V, dU, dV), Calc(V, U, dV, dU)) << "\n";
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 353 ms 16380 KB Output is correct
2 Correct 366 ms 16416 KB Output is correct
3 Correct 374 ms 16368 KB Output is correct
4 Correct 356 ms 16316 KB Output is correct
5 Correct 355 ms 16324 KB Output is correct
6 Correct 372 ms 16384 KB Output is correct
7 Correct 376 ms 16376 KB Output is correct
8 Correct 364 ms 16292 KB Output is correct
9 Correct 344 ms 16376 KB Output is correct
10 Correct 299 ms 16468 KB Output is correct
11 Correct 166 ms 13416 KB Output is correct
12 Correct 374 ms 16412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 384 ms 16456 KB Output is correct
2 Correct 398 ms 16548 KB Output is correct
3 Correct 393 ms 16504 KB Output is correct
4 Correct 451 ms 16372 KB Output is correct
5 Correct 388 ms 16536 KB Output is correct
6 Correct 379 ms 16312 KB Output is correct
7 Correct 386 ms 16376 KB Output is correct
8 Correct 377 ms 16508 KB Output is correct
9 Correct 388 ms 16528 KB Output is correct
10 Correct 397 ms 16372 KB Output is correct
11 Correct 157 ms 13288 KB Output is correct
12 Correct 367 ms 16412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 1024 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 15 ms 1664 KB Output is correct
5 Correct 8 ms 1024 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 8 ms 1408 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 353 ms 16380 KB Output is correct
2 Correct 366 ms 16416 KB Output is correct
3 Correct 374 ms 16368 KB Output is correct
4 Correct 356 ms 16316 KB Output is correct
5 Correct 355 ms 16324 KB Output is correct
6 Correct 372 ms 16384 KB Output is correct
7 Correct 376 ms 16376 KB Output is correct
8 Correct 364 ms 16292 KB Output is correct
9 Correct 344 ms 16376 KB Output is correct
10 Correct 299 ms 16468 KB Output is correct
11 Correct 166 ms 13416 KB Output is correct
12 Correct 374 ms 16412 KB Output is correct
13 Correct 384 ms 16456 KB Output is correct
14 Correct 398 ms 16548 KB Output is correct
15 Correct 393 ms 16504 KB Output is correct
16 Correct 451 ms 16372 KB Output is correct
17 Correct 388 ms 16536 KB Output is correct
18 Correct 379 ms 16312 KB Output is correct
19 Correct 386 ms 16376 KB Output is correct
20 Correct 377 ms 16508 KB Output is correct
21 Correct 388 ms 16528 KB Output is correct
22 Correct 397 ms 16372 KB Output is correct
23 Correct 157 ms 13288 KB Output is correct
24 Correct 367 ms 16412 KB Output is correct
25 Correct 8 ms 1024 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 15 ms 1664 KB Output is correct
29 Correct 8 ms 1024 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 8 ms 1408 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 351 ms 20252 KB Output is correct
41 Correct 362 ms 20724 KB Output is correct
42 Correct 350 ms 20636 KB Output is correct
43 Correct 180 ms 15464 KB Output is correct
44 Correct 168 ms 15336 KB Output is correct
45 Correct 345 ms 19760 KB Output is correct
46 Correct 358 ms 19520 KB Output is correct
47 Correct 365 ms 20144 KB Output is correct
48 Correct 190 ms 14932 KB Output is correct
49 Correct 322 ms 19800 KB Output is correct
50 Correct 357 ms 19984 KB Output is correct
51 Correct 348 ms 19780 KB Output is correct