oj.uz

Submission #854711

# Submission time Handle Problem Language Result Execution time Memory
854711 2023-09-28T15:25:58 Z hungnt Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 321 ms 25116 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 284 ms 20000 KB Output is correct
2 Correct 252 ms 18680 KB Output is correct
3 Correct 303 ms 23476 KB Output is correct
4 Correct 258 ms 20044 KB Output is correct
5 Correct 282 ms 18580 KB Output is correct
6 Correct 312 ms 19884 KB Output is correct
7 Correct 286 ms 18544 KB Output is correct
8 Correct 253 ms 18540 KB Output is correct
9 Correct 307 ms 18540 KB Output is correct
10 Correct 248 ms 21064 KB Output is correct
11 Correct 116 ms 20332 KB Output is correct
12 Correct 284 ms 22276 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 19300 KB Output is correct
2 Correct 275 ms 19816 KB Output is correct
3 Correct 290 ms 19140 KB Output is correct
4 Correct 292 ms 19680 KB Output is correct
5 Correct 294 ms 20248 KB Output is correct
6 Correct 289 ms 22848 KB Output is correct
7 Correct 295 ms 23500 KB Output is correct
8 Correct 283 ms 19632 KB Output is correct
9 Correct 278 ms 20396 KB Output is correct
10 Correct 266 ms 19160 KB Output is correct
11 Correct 116 ms 20444 KB Output is correct
12 Correct 270 ms 25116 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11096 KB Output is correct
2 Correct 3 ms 10840 KB Output is correct
3 Correct 3 ms 10588 KB Output is correct
4 Correct 28 ms 11856 KB Output is correct
5 Correct 15 ms 11100 KB Output is correct
6 Correct 4 ms 10584 KB Output is correct
7 Correct 4 ms 10588 KB Output is correct
8 Correct 5 ms 10724 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 15 ms 11100 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 3 ms 10684 KB Output is correct
13 Correct 3 ms 10588 KB Output is correct
14 Correct 4 ms 10588 KB Output is correct
15 Correct 3 ms 10584 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 20000 KB Output is correct
2 Correct 252 ms 18680 KB Output is correct
3 Correct 303 ms 23476 KB Output is correct
4 Correct 258 ms 20044 KB Output is correct
5 Correct 282 ms 18580 KB Output is correct
6 Correct 312 ms 19884 KB Output is correct
7 Correct 286 ms 18544 KB Output is correct
8 Correct 253 ms 18540 KB Output is correct
9 Correct 307 ms 18540 KB Output is correct
10 Correct 248 ms 21064 KB Output is correct
11 Correct 116 ms 20332 KB Output is correct
12 Correct 284 ms 22276 KB Output is correct
13 Correct 321 ms 19300 KB Output is correct
14 Correct 275 ms 19816 KB Output is correct
15 Correct 290 ms 19140 KB Output is correct
16 Correct 292 ms 19680 KB Output is correct
17 Correct 294 ms 20248 KB Output is correct
18 Correct 289 ms 22848 KB Output is correct
19 Correct 295 ms 23500 KB Output is correct
20 Correct 283 ms 19632 KB Output is correct
21 Correct 278 ms 20396 KB Output is correct
22 Correct 266 ms 19160 KB Output is correct
23 Correct 116 ms 20444 KB Output is correct
24 Correct 270 ms 25116 KB Output is correct
25 Correct 16 ms 11096 KB Output is correct
26 Correct 3 ms 10840 KB Output is correct
27 Correct 3 ms 10588 KB Output is correct
28 Correct 28 ms 11856 KB Output is correct
29 Correct 15 ms 11100 KB Output is correct
30 Correct 4 ms 10584 KB Output is correct
31 Correct 4 ms 10588 KB Output is correct
32 Correct 5 ms 10724 KB Output is correct
33 Correct 4 ms 10588 KB Output is correct
34 Correct 15 ms 11100 KB Output is correct
35 Correct 3 ms 10588 KB Output is correct
36 Correct 3 ms 10684 KB Output is correct
37 Correct 3 ms 10588 KB Output is correct
38 Correct 4 ms 10588 KB Output is correct
39 Correct 3 ms 10584 KB Output is correct
40 Correct 258 ms 24312 KB Output is correct
41 Correct 274 ms 22656 KB Output is correct
42 Correct 276 ms 22468 KB Output is correct
43 Correct 138 ms 22744 KB Output is correct
44 Correct 115 ms 22728 KB Output is correct
45 Correct 288 ms 22908 KB Output is correct
46 Correct 242 ms 22792 KB Output is correct
47 Correct 258 ms 24272 KB Output is correct
48 Correct 123 ms 19708 KB Output is correct
49 Correct 227 ms 23404 KB Output is correct
50 Correct 243 ms 22312 KB Output is correct
51 Correct 274 ms 22784 KB Output is correct