oj.uz

Submission #481597

# Submission time Handle Problem Language Result Execution time Memory
481597 2021-10-21T08:39:23 Z Soumya1 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 265 ms 22540 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5 + 5;
vector<pair<int, int>> ad[mxN];
void dijkstra(int u, vector<long long> &d, int n) {
  priority_queue<pair<long long, int>> pq;
  pq.push({0, u});
  d[u] = 0;
  vector<bool> vis(n + 1);
  while (!pq.empty()) {
    int u = pq.top().second;
    pq.pop();
    if (vis[u]) continue;
    vis[u] = true;
    for (auto [v, w] : ad[u]) {
      if (d[v] > d[u] + w) {
        d[v] = d[u] + w;
        pq.push({-d[v], v});
      }
    }
  }
}
void testCase() {
  int n, m, s, t, u, v;
  cin >> n >> m >> s >> t >> u >> v;
  while (m--) {
    int u, v, w;
    cin >> u >> v >> w;
    ad[u].push_back({v, w});
    ad[v].push_back({u, w});
  }
  vector<long long> du(n + 1, 1e18), dv(n + 1, 1e18);
  dijkstra(u, du, n);
  dijkstra(v, dv, n);
  vector<long long> d(n + 1, 1e18);
  vector<bool> vis(n + 1);
  vector<long long> min_du(n + 1, 1e18), min_dv(n + 1, 1e18);
  priority_queue<pair<long long, int>> pq;
  pq.push({0, s});
  d[s] = 0;
  min_du[s] = du[s];
  min_dv[s] = dv[s];
  while (!pq.empty()) {
    int node = pq.top().second;
    pq.pop();
    if (min_du[node] + min_dv[node] == 14) cout << node << endl;
    if (vis[node]) continue;
    vis[node] = true;
    for (auto [child, w] : ad[node]) {
      long long new_du = min(min_du[node], du[child]);
      long long new_dv = min(min_dv[node], dv[child]);
      if (d[child] == d[node] + w && new_du + new_dv < min_du[child] + min_dv[child]) {
        min_du[child] = new_du;
        min_dv[child] = new_dv;
      } else if (d[child] > d[node] + w) {
        d[child] = d[node] + w;
        min_du[child] = new_du;
        min_dv[child] = new_dv;
        pq.push({-d[child], child});
      }
    }
  }
  cout << min(du[v], min_du[t] + min_dv[t]) << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 18236 KB Output is correct
2 Correct 208 ms 17148 KB Output is correct
3 Correct 213 ms 16948 KB Output is correct
4 Correct 199 ms 17084 KB Output is correct
5 Correct 199 ms 16808 KB Output is correct
6 Correct 216 ms 18436 KB Output is correct
7 Correct 210 ms 17000 KB Output is correct
8 Correct 207 ms 17104 KB Output is correct
9 Correct 208 ms 16912 KB Output is correct
10 Correct 198 ms 21328 KB Output is correct
11 Correct 86 ms 14020 KB Output is correct
12 Correct 224 ms 21132 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 17140 KB Output is correct
2 Correct 242 ms 17144 KB Output is correct
3 Correct 229 ms 17088 KB Output is correct
4 Correct 216 ms 17048 KB Output is correct
5 Correct 265 ms 17096 KB Output is correct
6 Correct 204 ms 16812 KB Output is correct
7 Correct 251 ms 16944 KB Output is correct
8 Correct 223 ms 17048 KB Output is correct
9 Correct 220 ms 17004 KB Output is correct
10 Correct 218 ms 17024 KB Output is correct
11 Correct 121 ms 12104 KB Output is correct
12 Correct 214 ms 20464 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5708 KB Output is correct
2 Correct 3 ms 5048 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 15 ms 6356 KB Output is correct
5 Correct 8 ms 5632 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 12 ms 5740 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 18236 KB Output is correct
2 Correct 208 ms 17148 KB Output is correct
3 Correct 213 ms 16948 KB Output is correct
4 Correct 199 ms 17084 KB Output is correct
5 Correct 199 ms 16808 KB Output is correct
6 Correct 216 ms 18436 KB Output is correct
7 Correct 210 ms 17000 KB Output is correct
8 Correct 207 ms 17104 KB Output is correct
9 Correct 208 ms 16912 KB Output is correct
10 Correct 198 ms 21328 KB Output is correct
11 Correct 86 ms 14020 KB Output is correct
12 Correct 224 ms 21132 KB Output is correct
13 Correct 219 ms 17140 KB Output is correct
14 Correct 242 ms 17144 KB Output is correct
15 Correct 229 ms 17088 KB Output is correct
16 Correct 216 ms 17048 KB Output is correct
17 Correct 265 ms 17096 KB Output is correct
18 Correct 204 ms 16812 KB Output is correct
19 Correct 251 ms 16944 KB Output is correct
20 Correct 223 ms 17048 KB Output is correct
21 Correct 220 ms 17004 KB Output is correct
22 Correct 218 ms 17024 KB Output is correct
23 Correct 121 ms 12104 KB Output is correct
24 Correct 214 ms 20464 KB Output is correct
25 Correct 8 ms 5708 KB Output is correct
26 Correct 3 ms 5048 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 15 ms 6356 KB Output is correct
29 Correct 8 ms 5632 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 4 ms 5068 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 12 ms 5740 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 4 ms 5024 KB Output is correct
38 Correct 3 ms 5068 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 213 ms 22540 KB Output is correct
41 Correct 206 ms 21204 KB Output is correct
42 Correct 212 ms 21324 KB Output is correct
43 Correct 83 ms 14172 KB Output is correct
44 Correct 83 ms 14140 KB Output is correct
45 Correct 194 ms 20040 KB Output is correct
46 Correct 189 ms 20000 KB Output is correct
47 Correct 205 ms 20732 KB Output is correct
48 Correct 102 ms 13560 KB Output is correct
49 Correct 187 ms 22156 KB Output is correct
50 Correct 219 ms 20216 KB Output is correct
51 Correct 180 ms 20028 KB Output is correct