oj.uz

Submission #330167

# Submission time Handle Problem Language Result Execution time Memory
330167 2020-11-24T05:05:41 Z casperwang Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 476 ms 25320 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
using namespace std;

const int MAXN = 100000;
const int INF = 1e18;
int n, m;
int s, t, u, v;
int a, b, c;
vector <pii> path[MAXN+1];
int dpU[MAXN+1];
int dpV[MAXN+1];
pii arr[MAXN+1];
int ans = INF;
priority_queue <pii, vector<pii>, greater<pii>> nxt;

class Dijkstra{
  private:
    priority_queue <pii, vector<pii>, greater<pii>> nxt;
  public:
    int dis[MAXN+1];
    void init() {
      for (int i = 1; i <= n; i++)
        dis[i] = INF;
    }
    void shortest_path(int s) {
      init();
      dis[s] = 0;
      nxt.push(pii(0, s));
      while (nxt.size()) {
        int now = nxt.top().ss, d = nxt.top().ff;
        nxt.pop();
        for (pii e : path[now]) {
          if (d + e.ss < dis[e.ff]) {
            dis[e.ff] = d + e.ss;
            nxt.push(pii(dis[e.ff], e.ff));
          }
        }
      }
    }
} S, T, U, V;

void solve(int s) {
  for (int i = 1; i <= n; i++)
    arr[i] = pii(S.dis[i], i);
  sort(arr+1, arr+1+n);
  for (int i = 1; i <= n; i++) {
    int now = arr[i].ss, d = arr[i].ff;
    for (pii e : path[now]) {
      if (d + e.ss == S.dis[e.ff] && S.dis[now] + e.ss + T.dis[e.ff] == T.dis[s]) {
        dpU[e.ff] = min(dpU[e.ff], dpU[now]);
        dpV[e.ff] = min(dpV[e.ff], dpV[now]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    ans = min(ans, dpU[i] + V.dis[i]);
    ans = min(ans, dpV[i] + U.dis[i]);
  }
}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  cin >> s >> t;
  cin >> u >> v;
  for (int i = 0; i < m; i++) {
    cin >> a >> b >> c;
    path[a].pb(pii(b, c));
    path[b].pb(pii(a, c));
  }
  U.shortest_path(u);
  V.shortest_path(v);
  for (int i = 1; i <= n; i++) dpU[i] = U.dis[i];
  for (int i = 1; i <= n; i++) dpV[i] = V.dis[i];
  S.shortest_path(s);
  T.shortest_path(t);
  solve(s);
  cout << ans << "\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 24148 KB Output is correct
2 Correct 413 ms 23136 KB Output is correct
3 Correct 407 ms 22396 KB Output is correct
4 Correct 391 ms 24288 KB Output is correct
5 Correct 436 ms 22508 KB Output is correct
6 Correct 427 ms 24568 KB Output is correct
7 Correct 429 ms 23012 KB Output is correct
8 Correct 422 ms 23008 KB Output is correct
9 Correct 405 ms 22496 KB Output is correct
10 Correct 332 ms 21996 KB Output is correct
11 Correct 161 ms 14188 KB Output is correct
12 Correct 449 ms 22624 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 23404 KB Output is correct
2 Correct 449 ms 23012 KB Output is correct
3 Correct 476 ms 23012 KB Output is correct
4 Correct 475 ms 22932 KB Output is correct
5 Correct 440 ms 23012 KB Output is correct
6 Correct 418 ms 22368 KB Output is correct
7 Correct 453 ms 23008 KB Output is correct
8 Correct 450 ms 23012 KB Output is correct
9 Correct 451 ms 23136 KB Output is correct
10 Correct 428 ms 23148 KB Output is correct
11 Correct 176 ms 14316 KB Output is correct
12 Correct 462 ms 22644 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4204 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 17 ms 5484 KB Output is correct
5 Correct 10 ms 4076 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 4 ms 2924 KB Output is correct
9 Correct 4 ms 2924 KB Output is correct
10 Correct 10 ms 4204 KB Output is correct
11 Correct 2 ms 2796 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 24148 KB Output is correct
2 Correct 413 ms 23136 KB Output is correct
3 Correct 407 ms 22396 KB Output is correct
4 Correct 391 ms 24288 KB Output is correct
5 Correct 436 ms 22508 KB Output is correct
6 Correct 427 ms 24568 KB Output is correct
7 Correct 429 ms 23012 KB Output is correct
8 Correct 422 ms 23008 KB Output is correct
9 Correct 405 ms 22496 KB Output is correct
10 Correct 332 ms 21996 KB Output is correct
11 Correct 161 ms 14188 KB Output is correct
12 Correct 449 ms 22624 KB Output is correct
13 Correct 432 ms 23404 KB Output is correct
14 Correct 449 ms 23012 KB Output is correct
15 Correct 476 ms 23012 KB Output is correct
16 Correct 475 ms 22932 KB Output is correct
17 Correct 440 ms 23012 KB Output is correct
18 Correct 418 ms 22368 KB Output is correct
19 Correct 453 ms 23008 KB Output is correct
20 Correct 450 ms 23012 KB Output is correct
21 Correct 451 ms 23136 KB Output is correct
22 Correct 428 ms 23148 KB Output is correct
23 Correct 176 ms 14316 KB Output is correct
24 Correct 462 ms 22644 KB Output is correct
25 Correct 10 ms 4204 KB Output is correct
26 Correct 2 ms 2796 KB Output is correct
27 Correct 2 ms 2796 KB Output is correct
28 Correct 17 ms 5484 KB Output is correct
29 Correct 10 ms 4076 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 3 ms 2924 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 4 ms 2924 KB Output is correct
34 Correct 10 ms 4204 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 2 ms 2796 KB Output is correct
38 Correct 2 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 377 ms 24924 KB Output is correct
41 Correct 401 ms 23196 KB Output is correct
42 Correct 389 ms 22884 KB Output is correct
43 Correct 189 ms 14316 KB Output is correct
44 Correct 167 ms 14188 KB Output is correct
45 Correct 347 ms 22368 KB Output is correct
46 Correct 342 ms 21624 KB Output is correct
47 Correct 370 ms 25320 KB Output is correct
48 Correct 173 ms 14188 KB Output is correct
49 Correct 313 ms 24796 KB Output is correct
50 Correct 355 ms 21984 KB Output is correct
51 Correct 341 ms 21600 KB Output is correct