oj.uz

Submission #813114

# Submission time Handle Problem Language Result Execution time Memory
813114 2023-08-07T13:39:20 Z trangtranha28 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 317 ms 27236 KB 
#include <bits/stdc++.h>
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define fore(x, v) for(auto &x : v)
#define fi first
#define se second
using namespace std;

const long long INF = 1e18;
const int N = 1e5 + 5;
int n, m, source[4];
long long ans(INF), dist[4][N], dp[N][2], vi[N];
vector <pair <int, int> > graph[N];
vector <int> tree[N];

void dijkstra(int kth) {
  memset(dist[kth], 0x3f, sizeof(dist[kth]));
  dist[kth][source[kth]] = 0;
  priority_queue <pair <long long, int> > pq;      
  pq.push({0, source[kth]});
  while (!pq.empty()) {
    auto top = pq.top(); pq.pop();
    long long to = -top.fi;
    int u = top.se;
    if (to != dist[kth][u]) continue;
    fore(e, graph[u]) {
      long long cost = to + e.se;
      if (dist[kth][e.fi] > cost) {
        dist[kth][e.fi] = cost;
        pq.push({-cost, e.fi});
      }
    }
  }
}

void dfs(int u) {
  if (vi[u]) return;
  vi[u] = 1;
  fore(v, tree[u]) {
    dfs(v);
    dp[u][0] = min(dp[u][0], min(dp[v][0], dist[2][v]));
    dp[u][1] = min(dp[u][1], min(dp[v][1], dist[3][v]));
  }
  if (dp[u][0] < INF) {
    ans = min(ans, dp[u][0] + dist[3][u]);
  }
  if (dp[u][1] < INF) {
    ans = min(ans, dp[u][1] + dist[2][u]);
  }
}

int main() {
  cin >> n >> m;

  foru(i, 0, 3) {
    cin >> source[i];
  }

  foru(i, 1, m) {
    int u, v, w;
    cin >> u >> v >> w;
    graph[u].emplace_back(v, w);
    graph[v].emplace_back(u, w);
  }

  foru(i, 0, 3) {
    dijkstra(i);
  }

  foru(i, 1, n) {
    fore(e, graph[i]) {
      int j = e.fi;
      if (dist[0][i] + dist[1][j] + e.se != dist[0][source[1]]) continue;
      tree[i].push_back(j);
    }
  }

  memset(dp, 0x3f, sizeof(dp));
  dfs(source[0]);
  cout << min(dist[2][source[3]], ans);
  return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 21348 KB Output is correct
2 Correct 273 ms 20736 KB Output is correct
3 Correct 312 ms 27236 KB Output is correct
4 Correct 249 ms 21204 KB Output is correct
5 Correct 266 ms 21344 KB Output is correct
6 Correct 290 ms 21420 KB Output is correct
7 Correct 277 ms 21824 KB Output is correct
8 Correct 317 ms 21500 KB Output is correct
9 Correct 269 ms 20420 KB Output is correct
10 Correct 267 ms 20596 KB Output is correct
11 Correct 115 ms 20180 KB Output is correct
12 Correct 314 ms 20444 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 22988 KB Output is correct
2 Correct 277 ms 23184 KB Output is correct
3 Correct 317 ms 22524 KB Output is correct
4 Correct 291 ms 22952 KB Output is correct
5 Correct 280 ms 23696 KB Output is correct
6 Correct 280 ms 26536 KB Output is correct
7 Correct 269 ms 26860 KB Output is correct
8 Correct 283 ms 23136 KB Output is correct
9 Correct 281 ms 23684 KB Output is correct
10 Correct 267 ms 22588 KB Output is correct
11 Correct 117 ms 22400 KB Output is correct
12 Correct 284 ms 26920 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 10724 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9628 KB Output is correct
4 Correct 30 ms 11748 KB Output is correct
5 Correct 18 ms 10776 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 17 ms 10776 KB Output is correct
11 Correct 4 ms 9596 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9760 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 21348 KB Output is correct
2 Correct 273 ms 20736 KB Output is correct
3 Correct 312 ms 27236 KB Output is correct
4 Correct 249 ms 21204 KB Output is correct
5 Correct 266 ms 21344 KB Output is correct
6 Correct 290 ms 21420 KB Output is correct
7 Correct 277 ms 21824 KB Output is correct
8 Correct 317 ms 21500 KB Output is correct
9 Correct 269 ms 20420 KB Output is correct
10 Correct 267 ms 20596 KB Output is correct
11 Correct 115 ms 20180 KB Output is correct
12 Correct 314 ms 20444 KB Output is correct
13 Correct 301 ms 22988 KB Output is correct
14 Correct 277 ms 23184 KB Output is correct
15 Correct 317 ms 22524 KB Output is correct
16 Correct 291 ms 22952 KB Output is correct
17 Correct 280 ms 23696 KB Output is correct
18 Correct 280 ms 26536 KB Output is correct
19 Correct 269 ms 26860 KB Output is correct
20 Correct 283 ms 23136 KB Output is correct
21 Correct 281 ms 23684 KB Output is correct
22 Correct 267 ms 22588 KB Output is correct
23 Correct 117 ms 22400 KB Output is correct
24 Correct 284 ms 26920 KB Output is correct
25 Correct 18 ms 10724 KB Output is correct
26 Correct 4 ms 9684 KB Output is correct
27 Correct 5 ms 9628 KB Output is correct
28 Correct 30 ms 11748 KB Output is correct
29 Correct 18 ms 10776 KB Output is correct
30 Correct 5 ms 9684 KB Output is correct
31 Correct 6 ms 9812 KB Output is correct
32 Correct 6 ms 9812 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 17 ms 10776 KB Output is correct
35 Correct 4 ms 9596 KB Output is correct
36 Correct 4 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 5 ms 9760 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 251 ms 21764 KB Output is correct
41 Correct 273 ms 20560 KB Output is correct
42 Correct 282 ms 20424 KB Output is correct
43 Correct 123 ms 22652 KB Output is correct
44 Correct 130 ms 22760 KB Output is correct
45 Correct 242 ms 22848 KB Output is correct
46 Correct 237 ms 22576 KB Output is correct
47 Correct 270 ms 21248 KB Output is correct
48 Correct 116 ms 19500 KB Output is correct
49 Correct 237 ms 21348 KB Output is correct
50 Correct 286 ms 22236 KB Output is correct
51 Correct 236 ms 22796 KB Output is correct