Submission #630860

# Submission time Handle Problem Language Result Execution time Memory
630860 2022-08-17T09:11:13 Z Abrar_Al_Samit Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
327 ms 21048 KB
#include<bits/stdc++.h>
using namespace std;

const int MX = 1e5 + 5;
const long long INF = 1e18;

vector<pair<int,int>>g[MX];
int n, m, s, t, u, v;
vector<long long>d(MX, INF), d2(MX, INF), dist(MX, INF), dist2(MX, INF);
vector<long long>dp(MX, INF), dp2(MX, INF);
void PlayGround() {
  cin>>n>>m>>s>>t>>u>>v;

  for(int i=0; i<m; ++i) {
    int a, b, c;
    cin>>a>>b>>c;
    g[a].emplace_back(b, c);
    g[b].emplace_back(a, c);
  }

  for(int sc : {u, v}) {
    d[sc] = 0;

    priority_queue<pair<long long, int>>pq;
    pq.emplace(0, sc);
    while(!pq.empty()) {
      long long cost;
      int node;
      tie(cost, node) = pq.top(); pq.pop();
      cost = -cost;
      if(cost!=d[node]) continue;

      for(auto e : g[node]) if(e.second+cost<d[e.first]) {
        d[e.first] = cost+e.second;
        pq.emplace(-d[e.first], e.first);
      }
    }
    swap(d, d2);
  }

  for(int sc : {s, t}) {
    dist[sc] = 0;
    dp[sc] = d2[sc];
    priority_queue<pair<long long, int>>pq;
    pq.emplace(0, sc);

    while(!pq.empty()) {
      long long cost; int node;
      tie(cost, node) = pq.top(); pq.pop();
      cost = -cost;
      if(cost!=dist[node]) continue;

      for(auto e : g[node]) {
        if(e.second+cost<dist[e.first]) {
          dist[e.first] = cost+e.second;
          dp[e.first] = min(dp[node], d2[e.first]);
          pq.emplace(-dist[e.first], e.first);
        } else if(e.second+cost==dist[e.first]) {
          dp[e.first] = min(dp[e.first], dp[node]);
        }
      }
    }
    swap(dp, dp2);
    swap(dist, dist2);
  }

  long long ans = d[v];
  for(int i=1; i<=n; ++i) if(dist[i]+dist2[i]==dist[t]) {
    ans = min(ans, d[i]+min(dp[i], dp2[i]));
  }
  cout<<ans<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 310 ms 20644 KB Output is correct
2 Correct 327 ms 19248 KB Output is correct
3 Correct 283 ms 20472 KB Output is correct
4 Correct 267 ms 20520 KB Output is correct
5 Correct 274 ms 18840 KB Output is correct
6 Correct 246 ms 20724 KB Output is correct
7 Correct 294 ms 18892 KB Output is correct
8 Correct 281 ms 19044 KB Output is correct
9 Correct 247 ms 19784 KB Output is correct
10 Correct 226 ms 19988 KB Output is correct
11 Correct 84 ms 12652 KB Output is correct
12 Correct 259 ms 19760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 273 ms 19372 KB Output is correct
2 Correct 260 ms 19128 KB Output is correct
3 Correct 290 ms 19012 KB Output is correct
4 Correct 301 ms 18972 KB Output is correct
5 Correct 273 ms 19028 KB Output is correct
6 Correct 244 ms 19356 KB Output is correct
7 Correct 324 ms 18936 KB Output is correct
8 Correct 257 ms 19192 KB Output is correct
9 Correct 262 ms 19044 KB Output is correct
10 Correct 258 ms 18996 KB Output is correct
11 Correct 81 ms 12468 KB Output is correct
12 Correct 247 ms 19404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 8404 KB Output is correct
2 Correct 4 ms 7404 KB Output is correct
3 Correct 4 ms 7412 KB Output is correct
4 Correct 19 ms 9460 KB Output is correct
5 Correct 12 ms 8404 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7508 KB Output is correct
8 Correct 5 ms 7536 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 11 ms 8404 KB Output is correct
11 Correct 4 ms 7400 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 4 ms 7408 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 310 ms 20644 KB Output is correct
2 Correct 327 ms 19248 KB Output is correct
3 Correct 283 ms 20472 KB Output is correct
4 Correct 267 ms 20520 KB Output is correct
5 Correct 274 ms 18840 KB Output is correct
6 Correct 246 ms 20724 KB Output is correct
7 Correct 294 ms 18892 KB Output is correct
8 Correct 281 ms 19044 KB Output is correct
9 Correct 247 ms 19784 KB Output is correct
10 Correct 226 ms 19988 KB Output is correct
11 Correct 84 ms 12652 KB Output is correct
12 Correct 259 ms 19760 KB Output is correct
13 Correct 273 ms 19372 KB Output is correct
14 Correct 260 ms 19128 KB Output is correct
15 Correct 290 ms 19012 KB Output is correct
16 Correct 301 ms 18972 KB Output is correct
17 Correct 273 ms 19028 KB Output is correct
18 Correct 244 ms 19356 KB Output is correct
19 Correct 324 ms 18936 KB Output is correct
20 Correct 257 ms 19192 KB Output is correct
21 Correct 262 ms 19044 KB Output is correct
22 Correct 258 ms 18996 KB Output is correct
23 Correct 81 ms 12468 KB Output is correct
24 Correct 247 ms 19404 KB Output is correct
25 Correct 10 ms 8404 KB Output is correct
26 Correct 4 ms 7404 KB Output is correct
27 Correct 4 ms 7412 KB Output is correct
28 Correct 19 ms 9460 KB Output is correct
29 Correct 12 ms 8404 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 5 ms 7508 KB Output is correct
32 Correct 5 ms 7536 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 11 ms 8404 KB Output is correct
35 Correct 4 ms 7400 KB Output is correct
36 Correct 4 ms 7380 KB Output is correct
37 Correct 4 ms 7380 KB Output is correct
38 Correct 4 ms 7408 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 230 ms 21048 KB Output is correct
41 Correct 248 ms 19852 KB Output is correct
42 Correct 270 ms 19784 KB Output is correct
43 Correct 90 ms 12508 KB Output is correct
44 Correct 79 ms 12544 KB Output is correct
45 Correct 243 ms 18596 KB Output is correct
46 Correct 201 ms 18344 KB Output is correct
47 Correct 263 ms 20528 KB Output is correct
48 Correct 99 ms 12056 KB Output is correct
49 Correct 218 ms 20640 KB Output is correct
50 Correct 213 ms 18776 KB Output is correct
51 Correct 228 ms 18536 KB Output is correct